==> Synchronizing chroot copy [/home/leming/armv7/root] -> [leming]...done ==> Making package: fplll 5.5.0-1 (Tue Nov 12 17:33:33 2024) ==> Retrieving sources... -> Cloning fplll git repo... Cloning into bare repository '/home/leming/work/fplll/fplll'... ==> WARNING: Skipping verification of source file PGP signatures. ==> Validating source files with sha256sums... fplll ... Skipped ==> Making package: fplll 5.5.0-1 (Tue Nov 12 17:33:59 2024) ==> Checking runtime dependencies... ==> Installing missing dependencies... [?25lresolving dependencies... looking for conflicting packages... Packages (1) qd-2.3.24-1 Total Download Size: 0.31 MiB Total Installed Size: 0.63 MiB :: Proceed with installation? [Y/n] :: Retrieving packages... qd-2.3.24-1-armv7h downloading... checking keyring... checking package integrity... loading package files... checking for file conflicts... checking available disk space... :: Processing package changes... installing qd... :: Running post-transaction hooks... (1/1) Arming ConditionNeedsUpdate... [?25h==> Checking buildtime dependencies... ==> Installing missing dependencies... [?25lresolving dependencies... looking for conflicting packages... Packages (4) perl-error-0.17029-7 perl-mailtools-2.21-9 perl-timedate-2.33-7 git-2.47.0-1 Total Installed Size: 39.45 MiB :: Proceed with installation? [Y/n] checking keyring... checking package integrity... loading package files... checking for file conflicts... checking available disk space... :: Processing package changes... installing perl-error... installing perl-timedate... installing perl-mailtools... installing git... Optional dependencies for git tk: gitk and git gui openssh: ssh transport and crypto perl-libwww: git svn perl-term-readkey: git svn and interactive.singlekey setting perl-io-socket-ssl: git send-email TLS support perl-authen-sasl: git send-email TLS support perl-mediawiki-api: git mediawiki support perl-datetime-format-iso8601: git mediawiki support perl-lwp-protocol-https: git mediawiki https support perl-cgi: gitweb (web interface) support python: git svn & git p4 [installed] subversion: git svn org.freedesktop.secrets: keyring credential helper libsecret: libsecret credential helper [installed] :: Running post-transaction hooks... (1/4) Creating system user accounts... Creating group 'git' with GID 971. Creating user 'git' (git daemon user) with UID 971 and GID 971. (2/4) Reloading system manager configuration... Skipped: Current root is not booted. (3/4) Arming ConditionNeedsUpdate... (4/4) Warn about old perl modules [?25h==> Retrieving sources... ==> WARNING: Skipping all source file integrity checks. ==> Extracting sources... -> Creating working copy of fplll git repo... Cloning into 'fplll'... done. Switched to a new branch 'makepkg' ==> Starting prepare()... autoreconf: export WARNINGS= autoreconf: Entering directory '.' autoreconf: configure.ac: not using Gettext autoreconf: running: aclocal -I m4 autoreconf: configure.ac: tracing autoreconf: running: libtoolize --copy libtoolize: putting auxiliary files in '.'. libtoolize: copying file './ltmain.sh' libtoolize: putting macros in AC_CONFIG_MACRO_DIRS, 'm4'. libtoolize: copying file 'm4/libtool.m4' libtoolize: copying file 'm4/ltoptions.m4' libtoolize: copying file 'm4/ltsugar.m4' libtoolize: copying file 'm4/ltversion.m4' libtoolize: copying file 'm4/lt~obsolete.m4' autoreconf: configure.ac: not using Intltool autoreconf: configure.ac: not using Gtkdoc autoreconf: running: aclocal -I m4 autoreconf: running: /usr/bin/autoconf autoreconf: running: /usr/bin/autoheader autoreconf: running: automake --add-missing --copy --no-force configure.ac:29: installing './compile' configure.ac:8: installing './config.guess' configure.ac:8: installing './config.sub' configure.ac:20: installing './install-sh' configure.ac:20: installing './missing' fplll/Makefile.am: installing './depcomp' parallel-tests: installing './test-driver' autoreconf: Leaving directory '.' ==> Starting build()... checking whether to enable maintainer-specific portions of Makefiles... yes checking build system type... armv7l-unknown-linux-gnueabihf checking host system type... armv7l-unknown-linux-gnueabihf checking target system type... armv7l-unknown-linux-gnueabihf checking for a BSD-compatible install... /usr/bin/install -c checking whether sleep supports fractional seconds... yes checking filesystem timestamp resolution... 0.01 checking whether build environment is sane... yes checking for a race-free mkdir -p... /usr/bin/mkdir -p checking for gawk... gawk checking whether make sets $(MAKE)... yes checking whether make supports nested variables... yes checking xargs -n works... yes checking how to print strings... printf checking whether make supports the include directive... yes (GNU style) checking for 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... /usr/bin/sed checking for grep that handles long lines and -e... /usr/bin/grep checking for egrep... /usr/bin/grep -E checking for fgrep... /usr/bin/grep -F checking for ld used by gcc... /usr/bin/ld checking if the linker (/usr/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... 1572864 checking how to convert armv7l-unknown-linux-gnueabihf file names to armv7l-unknown-linux-gnueabihf format... func_convert_file_noop checking how to convert armv7l-unknown-linux-gnueabihf file names to toolchain format... func_convert_file_noop checking for /usr/bin/ld option to reload object files... -r checking for file... : checking for objdump... objdump checking how to recognize dependent libraries... pass_all checking for dlltool... no checking how to associate runtime and link libraries... printf %s\n checking for ar... ar checking for archiver @FILE support... @ checking for strip... strip 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... /usr/bin/dd checking how to truncate binary pipes... /usr/bin/dd bs=4096 count=1 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/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 for g++... g++ 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/bin/ld checking if the linker (/usr/bin/ld) is GNU ld... yes checking whether the g++ linker (/usr/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/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 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 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 or later... 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 for egrep -e... (cached) /usr/bin/grep -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 '/build/fplll/src/fplll' Making all in fplll make[2]: Entering directory '/build/fplll/src/fplll/fplll' make all-am make[3]: Entering directory '/build/fplll/src/fplll/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 In file included from /usr/include/c++/14.1.1/vector:65, from pruner/../nr/numvect.h:20, from pruner/../nr/matrix.h:21, from pruner/../gso_interface.h:22, from pruner/../gso.h:21, from pruner/../lll.h:21, from pruner/pruner.h:21, from bkz_param.h:24, from bkz.h:21, from bkz.cpp:20: /usr/include/c++/14.1.1/bits/stl_uninitialized.h: In function '_ForwardIterator std::__do_uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*]': /usr/include/c++/14.1.1/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >' changed in GCC 7.1 113 | __do_uninit_copy(_InputIterator __first, _InputIterator __last, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >' changed in GCC 7.1 In static member function 'static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*; bool _TrivialValueTypes = false]', inlined from '_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:185:15, inlined from '_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*; _Tp = fplll::FP_NR<qd_real>]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:373:37, inlined from 'std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = fplll::FP_NR<qd_real>; _Alloc = std::allocator<fplll::FP_NR<qd_real> >]' at /usr/include/c++/14.1.1/bits/stl_vector.h:606:31, inlined from 'bool fplll::BKZReduction<ZT, FT>::svp_postprocessing_generic(int, int, const std::vector<FT>&, bool) [with ZT = fplll::Z_NR<long int>; FT = fplll::FP_NR<qd_real>]' at bkz.cpp:209:14: /usr/include/c++/14.1.1/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >' changed in GCC 7.1 137 | { return std::__do_uninit_copy(__first, __last, __result); } | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In static member function 'static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*; bool _TrivialValueTypes = false]', inlined from '_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:185:15, inlined from '_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*; _Tp = fplll::FP_NR<qd_real>]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:373:37, inlined from 'std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = fplll::FP_NR<qd_real>; _Alloc = std::allocator<fplll::FP_NR<qd_real> >]' at /usr/include/c++/14.1.1/bits/stl_vector.h:606:31, inlined from 'bool fplll::BKZReduction<ZT, FT>::svp_postprocessing_generic(int, int, const std::vector<FT>&, bool) [with ZT = fplll::Z_NR<__mpz_struct [1]>; FT = fplll::FP_NR<qd_real>]' at bkz.cpp:209:14: /usr/include/c++/14.1.1/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >' changed in GCC 7.1 137 | { return std::__do_uninit_copy(__first, __last, __result); } | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In static member function 'static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*; bool _TrivialValueTypes = false]', inlined from '_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:185:15, inlined from '_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*; _Tp = fplll::FP_NR<qd_real>]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:373:37, inlined from 'std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = fplll::FP_NR<qd_real>; _Alloc = std::allocator<fplll::FP_NR<qd_real> >]' at /usr/include/c++/14.1.1/bits/stl_vector.h:606:31, inlined from 'std::pair<_T1, _T2>::pair(const std::pair<_T1, _T2>&) [with _T1 = fplll::FP_NR<qd_real>; _T2 = std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > >]' at /usr/include/c++/14.1.1/bits/stl_pair.h:294:17, inlined from 'void std::_Construct(_Tp*, _Args&& ...) [with _Tp = pair<fplll::FP_NR<qd_real>, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >; _Args = {const pair<fplll::FP_NR<qd_real>, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >&}]' at /usr/include/c++/14.1.1/bits/stl_construct.h:119:7, inlined from '_ForwardIterator std::__do_uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = const pair<fplll::FP_NR<qd_real>, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >*; _ForwardIterator = pair<fplll::FP_NR<qd_real>, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >*]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:120:21, inlined from 'static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = const std::pair<fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >*; _ForwardIterator = std::pair<fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >*; bool _TrivialValueTypes = false]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:137:32, inlined from '_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = const pair<fplll::FP_NR<qd_real>, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >*; _ForwardIterator = pair<fplll::FP_NR<qd_real>, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >*]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:185:15, inlined from '_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = const pair<fplll::FP_NR<qd_real>, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >*; _ForwardIterator = pair<fplll::FP_NR<qd_real>, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >*; _Tp = pair<fplll::FP_NR<qd_real>, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:373:37, inlined from '_ForwardIterator std::__uninitialized_move_if_noexcept_a(_InputIterator, _InputIterator, _ForwardIterator, _Allocator&) [with _InputIterator = pair<fplll::FP_NR<qd_real>, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >*; _ForwardIterator = pair<fplll::FP_NR<qd_real>, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >*; _Allocator = allocator<pair<fplll::FP_NR<qd_real>, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > > >]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:399:2, inlined from 'void std::vector<_Tp, _Alloc>::_M_default_append(size_type) [with _Tp = std::pair<fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >; _Alloc = std::allocator<std::pair<fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > > >]' at /usr/include/c++/14.1.1/bits/vector.tcc:894:46: /usr/include/c++/14.1.1/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >' changed in GCC 7.1 137 | { return std::__do_uninit_copy(__first, __last, __result); } | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In static member function 'static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*; bool _TrivialValueTypes = false]', inlined from '_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:185:15, inlined from '_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*; _Tp = fplll::FP_NR<qd_real>]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:373:37, inlined from 'std::vector<_Tp, _Alloc>::pointer std::vector<_Tp, _Alloc>::_M_allocate_and_copy(size_type, _ForwardIterator, _ForwardIterator) [with _ForwardIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >; _Tp = fplll::FP_NR<qd_real>; _Alloc = std::allocator<fplll::FP_NR<qd_real> >]' at /usr/include/c++/14.1.1/bits/stl_vector.h:1624:35, inlined from 'std::vector<_Tp, _Alloc>& std::vector<_Tp, _Alloc>::operator=(const std::vector<_Tp, _Alloc>&) [with _Tp = fplll::FP_NR<qd_real>; _Alloc = std::allocator<fplll::FP_NR<qd_real> >]' at /usr/include/c++/14.1.1/bits/vector.tcc:238:44, inlined from 'void fplll::FastEvaluator<FT>::eval_sub_sol(int, const std::vector<T>&, const fplll::enumf&) [with FT = fplll::FP_NR<qd_real>]' at enum/evaluator.h:201:36: /usr/include/c++/14.1.1/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >' changed in GCC 7.1 137 | { return std::__do_uninit_copy(__first, __last, __result); } | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In static member function 'static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*; bool _TrivialValueTypes = false]', inlined from '_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:185:15, inlined from '_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*; _Tp = fplll::FP_NR<qd_real>]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:373:37, inlined from 'std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = fplll::FP_NR<qd_real>; _Alloc = std::allocator<fplll::FP_NR<qd_real> >]' at /usr/include/c++/14.1.1/bits/stl_vector.h:606:31, inlined from 'constexpr std::pair<_T1, _T2>::pair(const _T1&, const _T2&) [with _U1 = const fplll::FP_NR<qd_real>; _U2 = std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > >; typename std::enable_if<(std::_PCC<true, _T1, _T2>::_ConstructiblePair<_U1, _U2>() && std::_PCC<true, _T1, _T2>::_ImplicitlyConvertiblePair<_U1, _U2>()), bool>::type <anonymous> = true; _T1 = const fplll::FP_NR<qd_real>; _T2 = std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > >]' at /usr/include/c++/14.1.1/bits/stl_pair.h:753:21, inlined from 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >; _Args = {const fplll::FP_NR<qd_real>&, const std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > >&}; _Tp = std::_Rb_tree_node<std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > > >]' at /usr/include/c++/14.1.1/bits/new_allocator.h:191:4, inlined from 'static void std::allocator_traits<std::allocator<_CharT> >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >; _Args = {const fplll::FP_NR<qd_real>&, const std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > >&}; _Tp = std::_Rb_tree_node<std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > > >]' at /usr/include/c++/14.1.1/bits/alloc_traits.h:534:17, inlined from 'void std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_construct_node(_Link_type, _Args&& ...) [with _Args = {const fplll::FP_NR<qd_real>&, const std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > >&}; _Key = fplll::FP_NR<qd_real>; _Val = std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >; _KeyOfValue = std::_Select1st<std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > > >; _Compare = std::greater<fplll::FP_NR<qd_real> >; _Alloc = std::allocator<std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > > >]' at /usr/include/c++/14.1.1/bits/stl_tree.h:593:32, inlined from 'std::_Rb_tree_node<_Val>* std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_create_node(_Args&& ...) [with _Args = {const fplll::FP_NR<qd_real>&, const std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > >&}; _Key = fplll::FP_NR<qd_real>; _Val = std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >; _KeyOfValue = std::_Select1st<std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > > >; _Compare = std::greater<fplll::FP_NR<qd_real> >; _Alloc = std::allocator<std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > > >]' at /usr/include/c++/14.1.1/bits/stl_tree.h:610:21, inlined from 'std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Auto_node::_Auto_node(std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&, _Args&& ...) [with _Args = {const fplll::FP_NR<qd_real>&, const std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > >&}; _Key = fplll::FP_NR<qd_real>; _Val = std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >; _KeyOfValue = std::_Select1st<std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > > >; _Compare = std::greater<fplll::FP_NR<qd_real> >; _Alloc = std::allocator<std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > > >]' at /usr/include/c++/14.1.1/bits/stl_tree.h:1633:32, inlined from 'std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_equal(_Args&& ...) [with _Args = {const fplll::FP_NR<qd_real>&, const std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > >&}; _Key = fplll::FP_NR<qd_real>; _Val = std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >; _KeyOfValue = std::_Select1st<std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > > >; _Compare = std::greater<fplll::FP_NR<qd_real> >; _Alloc = std::allocator<std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > > >]' at /usr/include/c++/14.1.1/bits/stl_tree.h:2445:13: /usr/include/c++/14.1.1/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >' changed in GCC 7.1 137 | { return std::__do_uninit_copy(__first, __last, __result); } | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ CXX libfplll_la-householder.lo CXX libfplll_la-hlll.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 In file included from /usr/include/c++/14.1.1/vector:65, from enum/../nr/numvect.h:20, from enum/../nr/matrix.h:21, from enum/../gso_interface.h:22, from enum/enumerate.h:22, from enum/enumerate.cpp:19: /usr/include/c++/14.1.1/bits/stl_uninitialized.h: In function '_ForwardIterator std::__do_uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*]': /usr/include/c++/14.1.1/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >' changed in GCC 7.1 113 | __do_uninit_copy(_InputIterator __first, _InputIterator __last, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_uninitialized.h:113:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >' changed in GCC 7.1 In static member function 'static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*; bool _TrivialValueTypes = false]', inlined from '_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:185:15, inlined from '_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*; _Tp = fplll::FP_NR<qd_real>]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:373:37, inlined from 'std::vector<_Tp, _Alloc>::pointer std::vector<_Tp, _Alloc>::_M_allocate_and_copy(size_type, _ForwardIterator, _ForwardIterator) [with _ForwardIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >; _Tp = fplll::FP_NR<qd_real>; _Alloc = std::allocator<fplll::FP_NR<qd_real> >]' at /usr/include/c++/14.1.1/bits/stl_vector.h:1624:35, inlined from 'std::vector<_Tp, _Alloc>& std::vector<_Tp, _Alloc>::operator=(const std::vector<_Tp, _Alloc>&) [with _Tp = fplll::FP_NR<qd_real>; _Alloc = std::allocator<fplll::FP_NR<qd_real> >]' at /usr/include/c++/14.1.1/bits/vector.tcc:238:44: /usr/include/c++/14.1.1/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >' changed in GCC 7.1 137 | { return std::__do_uninit_copy(__first, __last, __result); } | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In static member function 'static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*; bool _TrivialValueTypes = false]', inlined from '_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:185:15, inlined from '_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*; _Tp = fplll::FP_NR<qd_real>]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:373:37, inlined from 'std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = fplll::FP_NR<qd_real>; _Alloc = std::allocator<fplll::FP_NR<qd_real> >]' at /usr/include/c++/14.1.1/bits/stl_vector.h:606:31, inlined from 'std::pair<_T1, _T2>::pair(const std::pair<_T1, _T2>&) [with _T1 = fplll::FP_NR<qd_real>; _T2 = std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > >]' at /usr/include/c++/14.1.1/bits/stl_pair.h:294:17, inlined from 'void std::_Construct(_Tp*, _Args&& ...) [with _Tp = pair<fplll::FP_NR<qd_real>, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >; _Args = {const pair<fplll::FP_NR<qd_real>, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >&}]' at /usr/include/c++/14.1.1/bits/stl_construct.h:119:7, inlined from '_ForwardIterator std::__do_uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = const pair<fplll::FP_NR<qd_real>, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >*; _ForwardIterator = pair<fplll::FP_NR<qd_real>, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >*]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:120:21, inlined from 'static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = const std::pair<fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >*; _ForwardIterator = std::pair<fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >*; bool _TrivialValueTypes = false]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:137:32, inlined from '_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = const pair<fplll::FP_NR<qd_real>, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >*; _ForwardIterator = pair<fplll::FP_NR<qd_real>, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >*]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:185:15, inlined from '_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = const pair<fplll::FP_NR<qd_real>, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >*; _ForwardIterator = pair<fplll::FP_NR<qd_real>, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >*; _Tp = pair<fplll::FP_NR<qd_real>, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:373:37, inlined from '_ForwardIterator std::__uninitialized_move_if_noexcept_a(_InputIterator, _InputIterator, _ForwardIterator, _Allocator&) [with _InputIterator = pair<fplll::FP_NR<qd_real>, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >*; _ForwardIterator = pair<fplll::FP_NR<qd_real>, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >*; _Allocator = allocator<pair<fplll::FP_NR<qd_real>, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > > >]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:399:2, inlined from 'void std::vector<_Tp, _Alloc>::_M_default_append(size_type) [with _Tp = std::pair<fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >; _Alloc = std::allocator<std::pair<fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > > >]' at /usr/include/c++/14.1.1/bits/vector.tcc:894:46: /usr/include/c++/14.1.1/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >' changed in GCC 7.1 137 | { return std::__do_uninit_copy(__first, __last, __result); } | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In static member function 'static _ForwardIterator std::__uninitialized_copy<_TrivialValueTypes>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*; bool _TrivialValueTypes = false]', inlined from '_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:185:15, inlined from '_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, vector<fplll::FP_NR<qd_real>, allocator<fplll::FP_NR<qd_real> > > >; _ForwardIterator = fplll::FP_NR<qd_real>*; _Tp = fplll::FP_NR<qd_real>]' at /usr/include/c++/14.1.1/bits/stl_uninitialized.h:373:37, inlined from 'std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = fplll::FP_NR<qd_real>; _Alloc = std::allocator<fplll::FP_NR<qd_real> >]' at /usr/include/c++/14.1.1/bits/stl_vector.h:606:31, inlined from 'constexpr std::pair<_T1, _T2>::pair(const _T1&, const _T2&) [with _U1 = const fplll::FP_NR<qd_real>; _U2 = std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > >; typename std::enable_if<(std::_PCC<true, _T1, _T2>::_ConstructiblePair<_U1, _U2>() && std::_PCC<true, _T1, _T2>::_ImplicitlyConvertiblePair<_U1, _U2>()), bool>::type <anonymous> = true; _T1 = const fplll::FP_NR<qd_real>; _T2 = std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > >]' at /usr/include/c++/14.1.1/bits/stl_pair.h:753:21, inlined from 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >; _Args = {const fplll::FP_NR<qd_real>&, const std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > >&}; _Tp = std::_Rb_tree_node<std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > > >]' at /usr/include/c++/14.1.1/bits/new_allocator.h:191:4, inlined from 'static void std::allocator_traits<std::allocator<_CharT> >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >; _Args = {const fplll::FP_NR<qd_real>&, const std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > >&}; _Tp = std::_Rb_tree_node<std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > > >]' at /usr/include/c++/14.1.1/bits/alloc_traits.h:534:17, inlined from 'void std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_construct_node(_Link_type, _Args&& ...) [with _Args = {const fplll::FP_NR<qd_real>&, const std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > >&}; _Key = fplll::FP_NR<qd_real>; _Val = std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >; _KeyOfValue = std::_Select1st<std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > > >; _Compare = std::greater<fplll::FP_NR<qd_real> >; _Alloc = std::allocator<std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > > >]' at /usr/include/c++/14.1.1/bits/stl_tree.h:593:32, inlined from 'std::_Rb_tree_node<_Val>* std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_create_node(_Args&& ...) [with _Args = {const fplll::FP_NR<qd_real>&, const std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > >&}; _Key = fplll::FP_NR<qd_real>; _Val = std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >; _KeyOfValue = std::_Select1st<std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > > >; _Compare = std::greater<fplll::FP_NR<qd_real> >; _Alloc = std::allocator<std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > > >]' at /usr/include/c++/14.1.1/bits/stl_tree.h:610:21, inlined from 'std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Auto_node::_Auto_node(std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>&, _Args&& ...) [with _Args = {const fplll::FP_NR<qd_real>&, const std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > >&}; _Key = fplll::FP_NR<qd_real>; _Val = std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >; _KeyOfValue = std::_Select1st<std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > > >; _Compare = std::greater<fplll::FP_NR<qd_real> >; _Alloc = std::allocator<std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > > >]' at /usr/include/c++/14.1.1/bits/stl_tree.h:1633:32, inlined from 'std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_equal(_Args&& ...) [with _Args = {const fplll::FP_NR<qd_real>&, const std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > >&}; _Key = fplll::FP_NR<qd_real>; _Val = std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >; _KeyOfValue = std::_Select1st<std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > > >; _Compare = std::greater<fplll::FP_NR<qd_real> >; _Alloc = std::allocator<std::pair<const fplll::FP_NR<qd_real>, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > > >]' at /usr/include/c++/14.1.1/bits/stl_tree.h:2445:13: /usr/include/c++/14.1.1/bits/stl_uninitialized.h:137:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<const fplll::FP_NR<qd_real>*, std::vector<fplll::FP_NR<qd_real>, std::allocator<fplll::FP_NR<qd_real> > > >' changed in GCC 7.1 137 | { return std::__do_uninit_copy(__first, __last, __result); } | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 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 In file included from /usr/include/c++/14.1.1/bits/stl_algo.h:61, from /usr/include/c++/14.1.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++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 100>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 100>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 99>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 99>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 98>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 98>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 97>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 97>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 96>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 96>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 95>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 95>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 94>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 94>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 93>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 93>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 92>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 92>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 91>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 91>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1750 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Tp = pair<array<int, 100>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 In file included from /usr/include/c++/14.1.1/algorithm:60: /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Tp = pair<array<int, 100>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Tp = pair<array<int, 100>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Tp = pair<array<int, 100>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Tp = pair<array<int, 99>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Tp = pair<array<int, 99>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Tp = pair<array<int, 99>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Tp = pair<array<int, 99>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Tp = pair<array<int, 98>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Tp = pair<array<int, 98>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Tp = pair<array<int, 98>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Tp = pair<array<int, 98>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Tp = pair<array<int, 97>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Tp = pair<array<int, 97>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Tp = pair<array<int, 97>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Tp = pair<array<int, 97>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Tp = pair<array<int, 96>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Tp = pair<array<int, 96>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Tp = pair<array<int, 96>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Tp = pair<array<int, 96>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Tp = pair<array<int, 95>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Tp = pair<array<int, 95>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Tp = pair<array<int, 95>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Tp = pair<array<int, 95>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Tp = pair<array<int, 94>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Tp = pair<array<int, 94>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Tp = pair<array<int, 94>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Tp = pair<array<int, 94>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Tp = pair<array<int, 93>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Tp = pair<array<int, 93>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Tp = pair<array<int, 93>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Tp = pair<array<int, 93>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Tp = pair<array<int, 92>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Tp = pair<array<int, 92>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Tp = pair<array<int, 92>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Tp = pair<array<int, 92>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Tp = pair<array<int, 91>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Tp = pair<array<int, 91>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Tp = pair<array<int, 91>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Tp = pair<array<int, 91>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1770 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 100>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2359 | __merge_adaptive(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 99>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 98>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 97>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 96>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 95>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 94>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 93>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 92>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 91>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 100>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 99>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 98>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 97>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 96>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 95>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 94>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 93>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 92>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 91>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.1.1/bits/stl_algo.h:69: /usr/include/c++/14.1.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::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 91>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 92>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 93>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 94>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 95>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 96>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 97>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 98>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 99>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 100>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 91>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 91>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 91>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 91>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 92>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 92>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 92>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 92>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 93>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 93>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 93>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 93>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 94>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 94>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 94>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 94>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 95>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 95>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 95>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 95>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 96>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 96>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 96>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 96>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 97>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 97>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 97>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 97>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 98>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 98>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 98>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 98>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 99>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 99>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 99>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 99>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 100>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 100>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 100>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 100>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::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<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::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<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::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<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::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<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::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<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::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<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::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<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::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<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::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<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::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<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::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<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::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<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::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<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::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<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::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<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::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<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::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<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::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<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::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<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::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<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::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<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::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<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::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<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::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<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::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<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::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<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::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<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::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<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::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<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::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<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::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<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::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<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::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<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::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<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::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<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::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<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::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<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::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<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::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<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::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<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::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<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 91; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::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<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 91; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::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<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 91; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::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<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 91; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::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<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 91; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::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<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 91; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::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<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 91; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::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<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 91; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::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<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 91; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::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<array<int, 91>, pair<double, double> >*, vector<pair<array<int, 91>, pair<double, double> >, allocator<pair<array<int, 91>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<91, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 91; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 91>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 91>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 91>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::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<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 92; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::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<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 92; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::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<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 92; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::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<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 92; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::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<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 92; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::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<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 92; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::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<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 92; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::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<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 92; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::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<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 92; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::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<array<int, 92>, pair<double, double> >*, vector<pair<array<int, 92>, pair<double, double> >, allocator<pair<array<int, 92>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<92, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 92; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 92>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 92>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 92>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::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<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 93; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::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<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 93; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::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<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 93; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::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<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 93; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::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<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 93; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::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<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 93; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::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<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 93; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::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<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 93; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::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<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 93; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::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<array<int, 93>, pair<double, double> >*, vector<pair<array<int, 93>, pair<double, double> >, allocator<pair<array<int, 93>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<93, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 93; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 93>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 93>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 93>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::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<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 94; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::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<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 94; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::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<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 94; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::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<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 94; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::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<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 94; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::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<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 94; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::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<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 94; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::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<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 94; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::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<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 94; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::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<array<int, 94>, pair<double, double> >*, vector<pair<array<int, 94>, pair<double, double> >, allocator<pair<array<int, 94>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<94, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 94; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 94>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 94>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 94>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::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<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 95; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::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<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 95; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::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<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 95; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::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<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 95; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::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<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 95; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::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<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 95; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::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<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 95; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::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<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 95; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::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<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 95; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::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<array<int, 95>, pair<double, double> >*, vector<pair<array<int, 95>, pair<double, double> >, allocator<pair<array<int, 95>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<95, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 95; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 95>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 95>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 95>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::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<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 96; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::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<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 96; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::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<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 96; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::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<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 96; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::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<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 96; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::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<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 96; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::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<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 96; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::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<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 96; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::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<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 96; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::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<array<int, 96>, pair<double, double> >*, vector<pair<array<int, 96>, pair<double, double> >, allocator<pair<array<int, 96>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<96, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 96; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 96>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 96>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 96>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::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<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 97; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::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<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 97; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::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<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 97; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::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<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 97; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::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<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 97; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::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<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 97; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::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<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 97; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::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<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 97; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::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<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 97; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::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<array<int, 97>, pair<double, double> >*, vector<pair<array<int, 97>, pair<double, double> >, allocator<pair<array<int, 97>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<97, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 97; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 97>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 97>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 97>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::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<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 98; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::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<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 98; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::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<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 98; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::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<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 98; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::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<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 98; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::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<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 98; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::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<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 98; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::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<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 98; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::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<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 98; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::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<array<int, 98>, pair<double, double> >*, vector<pair<array<int, 98>, pair<double, double> >, allocator<pair<array<int, 98>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<98, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 98; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 98>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 98>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 98>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::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<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 99; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::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<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 99; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::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<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 99; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::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<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 99; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::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<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 99; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::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<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 99; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::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<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 99; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::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<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 99; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::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<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 99; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::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<array<int, 99>, pair<double, double> >*, vector<pair<array<int, 99>, pair<double, double> >, allocator<pair<array<int, 99>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<99, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 99; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 99>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 99>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 99>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::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<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 100; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::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<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 100; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::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<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 100; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::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<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 100; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::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<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 100; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::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<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 100; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::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<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 100; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::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<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 100; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::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<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 100; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::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<array<int, 100>, pair<double, double> >*, vector<pair<array<int, 100>, pair<double, double> >, allocator<pair<array<int, 100>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<100, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 100; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 100>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 100>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 100>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ CXX enum-parallel/libfplll_la-enumlib_dim.80.lo In file included from /usr/include/c++/14.1.1/bits/stl_algo.h:61, from /usr/include/c++/14.1.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++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 110>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 110>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 109>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 109>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 108>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 108>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 107>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 107>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 106>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 106>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 105>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 105>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 104>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 104>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 103>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 103>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 102>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 102>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 101>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 101>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1750 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Tp = pair<array<int, 110>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 In file included from /usr/include/c++/14.1.1/algorithm:60: /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Tp = pair<array<int, 110>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Tp = pair<array<int, 110>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Tp = pair<array<int, 110>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Tp = pair<array<int, 109>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Tp = pair<array<int, 109>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Tp = pair<array<int, 109>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Tp = pair<array<int, 109>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Tp = pair<array<int, 108>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Tp = pair<array<int, 108>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Tp = pair<array<int, 108>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Tp = pair<array<int, 108>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Tp = pair<array<int, 107>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Tp = pair<array<int, 107>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Tp = pair<array<int, 107>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Tp = pair<array<int, 107>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Tp = pair<array<int, 106>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Tp = pair<array<int, 106>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Tp = pair<array<int, 106>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Tp = pair<array<int, 106>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Tp = pair<array<int, 105>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Tp = pair<array<int, 105>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Tp = pair<array<int, 105>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Tp = pair<array<int, 105>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Tp = pair<array<int, 104>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Tp = pair<array<int, 104>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Tp = pair<array<int, 104>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Tp = pair<array<int, 104>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Tp = pair<array<int, 103>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Tp = pair<array<int, 103>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Tp = pair<array<int, 103>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Tp = pair<array<int, 103>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Tp = pair<array<int, 102>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Tp = pair<array<int, 102>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Tp = pair<array<int, 102>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Tp = pair<array<int, 102>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Tp = pair<array<int, 101>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Tp = pair<array<int, 101>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Tp = pair<array<int, 101>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Tp = pair<array<int, 101>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1770 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 110>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2359 | __merge_adaptive(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 109>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 108>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 107>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 106>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 105>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 104>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 103>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 102>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 101>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 110>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 109>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 108>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 107>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 106>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 105>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 104>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 103>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 102>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 101>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.1.1/bits/stl_algo.h:69: /usr/include/c++/14.1.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::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 101>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 102>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 103>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 104>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 105>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 106>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 107>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 108>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 109>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 110>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 101>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 101>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 101>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 101>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 102>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 102>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 102>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 102>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 103>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 103>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 103>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 103>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 104>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 104>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 104>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 104>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 105>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 105>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 105>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 105>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 106>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 106>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 106>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 106>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 107>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 107>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 107>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 107>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 108>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 108>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 108>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 108>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 109>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 109>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 109>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 109>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 110>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 110>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 110>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 110>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::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<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::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<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::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<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::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<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::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<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::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<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::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<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::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<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::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<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::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<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::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<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::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<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::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<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::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<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::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<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::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<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::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<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::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<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::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<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::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<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::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<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::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<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::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<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::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<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::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<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::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<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::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<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::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<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::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<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::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<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::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<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::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<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::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<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::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<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::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<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::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<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::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<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::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<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::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<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::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<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::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<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 101; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::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<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 101; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::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<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 101; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::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<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 101; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::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<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 101; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::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<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 101; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::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<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 101; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::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<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 101; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::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<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 101; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::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<array<int, 101>, pair<double, double> >*, vector<pair<array<int, 101>, pair<double, double> >, allocator<pair<array<int, 101>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<101, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 101; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 101>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 101>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 101>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::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<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 102; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::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<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 102; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::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<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 102; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::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<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 102; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::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<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 102; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::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<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 102; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::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<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 102; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::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<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 102; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::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<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 102; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::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<array<int, 102>, pair<double, double> >*, vector<pair<array<int, 102>, pair<double, double> >, allocator<pair<array<int, 102>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<102, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 102; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 102>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 102>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 102>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::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<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 103; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::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<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 103; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::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<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 103; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::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<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 103; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::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<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 103; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::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<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 103; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::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<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 103; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::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<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 103; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::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<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 103; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::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<array<int, 103>, pair<double, double> >*, vector<pair<array<int, 103>, pair<double, double> >, allocator<pair<array<int, 103>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<103, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 103; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 103>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 103>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 103>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::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<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 104; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::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<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 104; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::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<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 104; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::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<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 104; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::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<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 104; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::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<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 104; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::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<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 104; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::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<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 104; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::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<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 104; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::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<array<int, 104>, pair<double, double> >*, vector<pair<array<int, 104>, pair<double, double> >, allocator<pair<array<int, 104>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<104, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 104; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 104>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 104>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 104>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::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<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 105; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::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<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 105; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::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<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 105; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::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<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 105; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::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<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 105; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::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<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 105; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::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<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 105; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::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<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 105; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::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<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 105; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::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<array<int, 105>, pair<double, double> >*, vector<pair<array<int, 105>, pair<double, double> >, allocator<pair<array<int, 105>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<105, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 105; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 105>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 105>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 105>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::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<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 106; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::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<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 106; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::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<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 106; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::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<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 106; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::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<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 106; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::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<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 106; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::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<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 106; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::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<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 106; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::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<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 106; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::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<array<int, 106>, pair<double, double> >*, vector<pair<array<int, 106>, pair<double, double> >, allocator<pair<array<int, 106>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<106, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 106; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 106>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 106>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 106>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::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<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 107; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::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<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 107; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::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<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 107; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::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<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 107; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::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<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 107; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::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<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 107; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::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<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 107; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::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<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 107; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::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<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 107; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::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<array<int, 107>, pair<double, double> >*, vector<pair<array<int, 107>, pair<double, double> >, allocator<pair<array<int, 107>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<107, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 107; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 107>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 107>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 107>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::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<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 108; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::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<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 108; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::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<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 108; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::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<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 108; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::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<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 108; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::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<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 108; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::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<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 108; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::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<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 108; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::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<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 108; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::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<array<int, 108>, pair<double, double> >*, vector<pair<array<int, 108>, pair<double, double> >, allocator<pair<array<int, 108>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<108, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 108; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 108>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 108>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 108>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::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<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 109; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::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<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 109; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::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<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 109; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::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<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 109; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::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<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 109; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::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<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 109; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::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<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 109; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::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<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 109; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::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<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 109; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::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<array<int, 109>, pair<double, double> >*, vector<pair<array<int, 109>, pair<double, double> >, allocator<pair<array<int, 109>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<109, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 109; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 109>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 109>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 109>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::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<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 110; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::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<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 110; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::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<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 110; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::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<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 110; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::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<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 110; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::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<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 110; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::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<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 110; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::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<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 110; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::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<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 110; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::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<array<int, 110>, pair<double, double> >*, vector<pair<array<int, 110>, pair<double, double> >, allocator<pair<array<int, 110>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<110, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 110; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 110>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 110>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 110>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.1.1/bits/stl_algo.h:61, from /usr/include/c++/14.1.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++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 120>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 120>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 119>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 119>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 118>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 118>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 117>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 117>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 116>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 116>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 115>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 115>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 114>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 114>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 113>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 113>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 112>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 112>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 111>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 111>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1750 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Tp = pair<array<int, 120>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 In file included from /usr/include/c++/14.1.1/algorithm:60: /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Tp = pair<array<int, 120>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Tp = pair<array<int, 120>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Tp = pair<array<int, 120>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Tp = pair<array<int, 119>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Tp = pair<array<int, 119>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Tp = pair<array<int, 119>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Tp = pair<array<int, 119>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Tp = pair<array<int, 118>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Tp = pair<array<int, 118>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Tp = pair<array<int, 118>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Tp = pair<array<int, 118>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Tp = pair<array<int, 117>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Tp = pair<array<int, 117>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Tp = pair<array<int, 117>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Tp = pair<array<int, 117>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Tp = pair<array<int, 116>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Tp = pair<array<int, 116>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Tp = pair<array<int, 116>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Tp = pair<array<int, 116>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Tp = pair<array<int, 115>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Tp = pair<array<int, 115>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Tp = pair<array<int, 115>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Tp = pair<array<int, 115>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Tp = pair<array<int, 114>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Tp = pair<array<int, 114>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Tp = pair<array<int, 114>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Tp = pair<array<int, 114>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Tp = pair<array<int, 113>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Tp = pair<array<int, 113>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Tp = pair<array<int, 113>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Tp = pair<array<int, 113>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Tp = pair<array<int, 112>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Tp = pair<array<int, 112>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Tp = pair<array<int, 112>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Tp = pair<array<int, 112>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Tp = pair<array<int, 111>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Tp = pair<array<int, 111>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Tp = pair<array<int, 111>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Tp = pair<array<int, 111>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1770 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 120>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2359 | __merge_adaptive(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 119>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 118>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 117>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 116>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 115>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 114>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 113>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 112>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 111>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 120>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 119>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 118>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 117>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 116>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 115>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 114>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 113>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 112>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 111>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.1.1/bits/stl_algo.h:69: /usr/include/c++/14.1.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::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 111>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 112>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 113>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 114>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 115>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 116>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 117>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 118>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 119>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 120>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 111>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 111>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 111>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 111>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 112>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 112>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 112>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 112>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 113>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 113>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 113>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 113>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 114>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 114>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 114>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 114>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 115>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 115>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 115>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 115>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 116>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 116>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 116>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 116>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 117>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 117>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 117>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 117>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 118>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 118>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 118>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 118>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 119>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 119>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 119>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 119>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 120>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 120>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 120>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 120>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::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<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::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<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::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<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::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<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::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<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::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<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::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<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::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<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::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<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::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<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::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<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::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<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::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<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::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<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::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<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::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<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::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<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::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<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::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<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::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<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::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<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::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<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::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<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::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<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::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<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::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<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::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<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::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<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::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<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::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<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::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<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::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<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::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<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::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<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::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<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::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<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::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<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::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<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::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<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::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<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::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<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 111; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::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<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 111; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::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<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 111; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::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<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 111; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::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<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 111; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::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<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 111; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::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<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 111; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::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<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 111; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::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<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 111; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::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<array<int, 111>, pair<double, double> >*, vector<pair<array<int, 111>, pair<double, double> >, allocator<pair<array<int, 111>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<111, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 111; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 111>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 111>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 111>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::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<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 112; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::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<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 112; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::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<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 112; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::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<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 112; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::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<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 112; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::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<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 112; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::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<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 112; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::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<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 112; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::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<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 112; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::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<array<int, 112>, pair<double, double> >*, vector<pair<array<int, 112>, pair<double, double> >, allocator<pair<array<int, 112>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<112, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 112; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 112>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 112>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 112>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::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<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 113; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::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<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 113; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::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<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 113; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::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<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 113; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::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<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 113; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::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<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 113; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::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<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 113; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::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<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 113; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::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<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 113; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::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<array<int, 113>, pair<double, double> >*, vector<pair<array<int, 113>, pair<double, double> >, allocator<pair<array<int, 113>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<113, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 113; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 113>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 113>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 113>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::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<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 114; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::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<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 114; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::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<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 114; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::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<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 114; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::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<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 114; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::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<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 114; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::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<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 114; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::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<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 114; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::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<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 114; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::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<array<int, 114>, pair<double, double> >*, vector<pair<array<int, 114>, pair<double, double> >, allocator<pair<array<int, 114>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<114, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 114; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 114>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 114>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 114>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::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<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 115; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::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<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 115; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::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<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 115; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::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<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 115; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::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<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 115; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::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<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 115; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::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<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 115; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::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<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 115; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::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<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 115; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::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<array<int, 115>, pair<double, double> >*, vector<pair<array<int, 115>, pair<double, double> >, allocator<pair<array<int, 115>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<115, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 115; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 115>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 115>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 115>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::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<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 116; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::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<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 116; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::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<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 116; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::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<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 116; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::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<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 116; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::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<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 116; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::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<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 116; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::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<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 116; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::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<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 116; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::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<array<int, 116>, pair<double, double> >*, vector<pair<array<int, 116>, pair<double, double> >, allocator<pair<array<int, 116>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<116, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 116; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 116>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 116>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 116>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::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<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 117; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::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<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 117; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::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<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 117; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::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<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 117; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::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<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 117; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::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<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 117; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::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<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 117; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::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<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 117; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::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<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 117; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::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<array<int, 117>, pair<double, double> >*, vector<pair<array<int, 117>, pair<double, double> >, allocator<pair<array<int, 117>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<117, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 117; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 117>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 117>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 117>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::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<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 118; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::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<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 118; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::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<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 118; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::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<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 118; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::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<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 118; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::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<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 118; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::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<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 118; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::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<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 118; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::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<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 118; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::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<array<int, 118>, pair<double, double> >*, vector<pair<array<int, 118>, pair<double, double> >, allocator<pair<array<int, 118>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<118, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 118; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 118>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 118>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 118>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::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<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 119; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::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<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 119; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::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<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 119; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::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<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 119; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::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<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 119; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::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<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 119; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::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<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 119; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::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<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 119; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::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<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 119; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::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<array<int, 119>, pair<double, double> >*, vector<pair<array<int, 119>, pair<double, double> >, allocator<pair<array<int, 119>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<119, 6, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 119; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 119>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 119>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 119>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::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<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 120; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::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<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 120; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::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<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 120; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::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<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 120; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::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<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 120; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::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<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 120; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::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<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 120; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::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<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 120; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::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<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 120; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::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<array<int, 120>, pair<double, double> >*, vector<pair<array<int, 120>, pair<double, double> >, allocator<pair<array<int, 120>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<120, 7, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 120; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 120>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 120>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 120>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.1.1/bits/stl_algo.h:61, from /usr/include/c++/14.1.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++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 90>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 90>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 89>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 89>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 88>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 88>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 87>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 87>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 86>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 86>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 85>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 85>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 84>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 84>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 83>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 83>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 82>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 82>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 81>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 81>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1750 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Tp = pair<array<int, 90>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 In file included from /usr/include/c++/14.1.1/algorithm:60: /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Tp = pair<array<int, 90>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Tp = pair<array<int, 90>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Tp = pair<array<int, 90>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Tp = pair<array<int, 89>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Tp = pair<array<int, 89>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Tp = pair<array<int, 89>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Tp = pair<array<int, 89>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Tp = pair<array<int, 88>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Tp = pair<array<int, 88>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Tp = pair<array<int, 88>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Tp = pair<array<int, 88>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Tp = pair<array<int, 87>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Tp = pair<array<int, 87>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Tp = pair<array<int, 87>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Tp = pair<array<int, 87>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Tp = pair<array<int, 86>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Tp = pair<array<int, 86>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Tp = pair<array<int, 86>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Tp = pair<array<int, 86>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Tp = pair<array<int, 85>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Tp = pair<array<int, 85>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Tp = pair<array<int, 85>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Tp = pair<array<int, 85>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Tp = pair<array<int, 84>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Tp = pair<array<int, 84>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Tp = pair<array<int, 84>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Tp = pair<array<int, 84>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Tp = pair<array<int, 83>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Tp = pair<array<int, 83>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Tp = pair<array<int, 83>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Tp = pair<array<int, 83>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Tp = pair<array<int, 82>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Tp = pair<array<int, 82>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Tp = pair<array<int, 82>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Tp = pair<array<int, 82>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Tp = pair<array<int, 81>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Tp = pair<array<int, 81>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Tp = pair<array<int, 81>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Tp = pair<array<int, 81>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1770 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 90>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2359 | __merge_adaptive(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 89>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 88>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 87>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 86>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 85>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 84>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 83>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 82>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 81>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 90>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 89>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 88>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 87>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 86>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 85>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 84>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 83>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 82>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 81>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.1.1/bits/stl_algo.h:69: /usr/include/c++/14.1.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::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 81>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 82>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 83>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 84>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 85>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 86>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 87>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 88>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 89>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 90>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 81>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 81>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 81>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 81>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 82>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 82>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 82>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 82>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 83>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 83>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 83>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 83>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 84>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 84>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 84>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 84>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 85>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 85>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 85>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 85>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 86>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 86>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 86>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 86>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 87>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 87>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 87>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 87>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 88>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 88>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 88>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 88>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 89>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 89>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 89>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 89>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 90>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 90>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 90>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 90>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::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<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::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<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::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<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::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<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::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<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::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<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::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<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::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<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::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<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::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<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::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<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::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<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::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<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::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<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::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<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::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<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::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<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::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<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::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<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::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<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::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<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::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<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::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<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::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<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::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<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::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<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::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<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::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<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::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<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::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<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::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<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::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<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::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<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::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<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::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<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::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<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::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<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::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<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::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<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::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<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::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<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 81; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::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<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 81; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::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<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 81; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::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<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 81; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::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<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 81; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::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<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 81; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::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<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 81; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::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<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 81; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::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<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 81; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::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<array<int, 81>, pair<double, double> >*, vector<pair<array<int, 81>, pair<double, double> >, allocator<pair<array<int, 81>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<81, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 81; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 81>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 81>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 81>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::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<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 82; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::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<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 82; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::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<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 82; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::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<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 82; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::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<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 82; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::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<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 82; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::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<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 82; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::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<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 82; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::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<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 82; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::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<array<int, 82>, pair<double, double> >*, vector<pair<array<int, 82>, pair<double, double> >, allocator<pair<array<int, 82>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<82, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 82; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 82>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 82>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 82>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::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<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 83; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::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<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 83; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::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<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 83; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::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<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 83; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::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<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 83; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::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<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 83; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::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<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 83; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::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<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 83; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::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<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 83; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::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<array<int, 83>, pair<double, double> >*, vector<pair<array<int, 83>, pair<double, double> >, allocator<pair<array<int, 83>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<83, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 83; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 83>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 83>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 83>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::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<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 84; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::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<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 84; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::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<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 84; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::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<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 84; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::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<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 84; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::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<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 84; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::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<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 84; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::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<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 84; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::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<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 84; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::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<array<int, 84>, pair<double, double> >*, vector<pair<array<int, 84>, pair<double, double> >, allocator<pair<array<int, 84>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<84, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 84; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 84>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 84>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 84>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::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<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 85; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::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<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 85; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::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<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 85; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::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<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 85; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::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<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 85; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::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<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 85; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::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<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 85; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::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<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 85; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::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<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 85; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::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<array<int, 85>, pair<double, double> >*, vector<pair<array<int, 85>, pair<double, double> >, allocator<pair<array<int, 85>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<85, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 85; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 85>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 85>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 85>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::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<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 86; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::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<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 86; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::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<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 86; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::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<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 86; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::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<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 86; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::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<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 86; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::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<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 86; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::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<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 86; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::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<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 86; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::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<array<int, 86>, pair<double, double> >*, vector<pair<array<int, 86>, pair<double, double> >, allocator<pair<array<int, 86>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<86, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 86; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 86>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 86>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 86>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::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<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 87; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::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<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 87; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::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<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 87; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::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<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 87; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::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<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 87; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::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<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 87; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::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<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 87; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::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<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 87; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::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<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 87; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::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<array<int, 87>, pair<double, double> >*, vector<pair<array<int, 87>, pair<double, double> >, allocator<pair<array<int, 87>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<87, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 87; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 87>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 87>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 87>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::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<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 88; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::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<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 88; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::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<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 88; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::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<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 88; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::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<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 88; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::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<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 88; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::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<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 88; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::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<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 88; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::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<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 88; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::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<array<int, 88>, pair<double, double> >*, vector<pair<array<int, 88>, pair<double, double> >, allocator<pair<array<int, 88>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<88, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 88; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 88>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 88>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 88>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::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<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 89; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::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<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 89; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::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<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 89; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::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<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 89; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::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<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 89; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::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<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 89; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::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<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 89; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::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<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 89; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::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<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 89; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::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<array<int, 89>, pair<double, double> >*, vector<pair<array<int, 89>, pair<double, double> >, allocator<pair<array<int, 89>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<89, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 89; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 89>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 89>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 89>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::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<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 90; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::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<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 90; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::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<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 90; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::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<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 90; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::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<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 90; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::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<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 90; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::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<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 90; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::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<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 90; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::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<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 90; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::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<array<int, 90>, pair<double, double> >*, vector<pair<array<int, 90>, pair<double, double> >, allocator<pair<array<int, 90>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<90, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 90; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 90>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 90>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 90>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.1.1/bits/stl_algo.h:61, from /usr/include/c++/14.1.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++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 80>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 80>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 79>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 79>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 78>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 78>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 77>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 77>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 76>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 76>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 75>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 75>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 74>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 74>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 73>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 73>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 72>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 72>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 71>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 71>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1750 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Tp = pair<array<int, 80>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 In file included from /usr/include/c++/14.1.1/algorithm:60: /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Tp = pair<array<int, 80>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Tp = pair<array<int, 80>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Tp = pair<array<int, 80>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Tp = pair<array<int, 79>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Tp = pair<array<int, 79>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Tp = pair<array<int, 79>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Tp = pair<array<int, 79>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Tp = pair<array<int, 78>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Tp = pair<array<int, 78>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Tp = pair<array<int, 78>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Tp = pair<array<int, 78>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Tp = pair<array<int, 77>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Tp = pair<array<int, 77>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Tp = pair<array<int, 77>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Tp = pair<array<int, 77>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Tp = pair<array<int, 76>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Tp = pair<array<int, 76>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Tp = pair<array<int, 76>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Tp = pair<array<int, 76>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Tp = pair<array<int, 75>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Tp = pair<array<int, 75>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Tp = pair<array<int, 75>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Tp = pair<array<int, 75>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Tp = pair<array<int, 74>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Tp = pair<array<int, 74>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Tp = pair<array<int, 74>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Tp = pair<array<int, 74>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Tp = pair<array<int, 73>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Tp = pair<array<int, 73>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Tp = pair<array<int, 73>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Tp = pair<array<int, 73>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Tp = pair<array<int, 72>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Tp = pair<array<int, 72>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Tp = pair<array<int, 72>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Tp = pair<array<int, 72>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Tp = pair<array<int, 71>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Tp = pair<array<int, 71>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Tp = pair<array<int, 71>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Tp = pair<array<int, 71>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1770 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 80>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2359 | __merge_adaptive(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 79>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 78>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 77>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 76>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 75>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 74>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 73>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 72>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 71>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 80>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 79>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 78>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 77>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 76>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 75>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 74>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 73>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 72>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 71>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.1.1/bits/stl_algo.h:69: /usr/include/c++/14.1.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::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 71>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 72>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 73>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 74>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 75>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 76>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 77>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 78>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 79>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 80>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 71>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 71>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 71>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 71>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 72>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 72>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 72>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 72>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 73>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 73>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 73>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 73>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 74>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 74>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 74>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 74>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 75>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 75>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 75>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 75>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 76>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 76>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 76>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 76>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 77>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 77>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 77>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 77>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 78>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 78>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 78>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 78>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 79>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 79>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 79>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 79>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 80>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 80>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 80>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 80>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::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<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::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<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::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<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 71; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::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<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 71; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::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<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 71; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::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<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 71; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::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<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 71; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::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<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::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<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::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<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 71; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::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<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 71; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::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<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 71; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::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<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 71; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::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<array<int, 71>, pair<double, double> >*, vector<pair<array<int, 71>, pair<double, double> >, allocator<pair<array<int, 71>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<71, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 71; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 71>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 71>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 71>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::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<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::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<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::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<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 72; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::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<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 72; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::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<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 72; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::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<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 72; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::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<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 72; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::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<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::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<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::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<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 72; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::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<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 72; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::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<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 72; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::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<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 72; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::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<array<int, 72>, pair<double, double> >*, vector<pair<array<int, 72>, pair<double, double> >, allocator<pair<array<int, 72>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<72, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 72; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 72>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 72>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 72>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::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<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::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<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::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<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 73; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::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<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 73; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::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<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 73; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::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<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 73; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::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<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 73; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::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<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::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<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::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<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 73; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::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<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 73; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::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<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 73; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::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<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 73; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::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<array<int, 73>, pair<double, double> >*, vector<pair<array<int, 73>, pair<double, double> >, allocator<pair<array<int, 73>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<73, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 73; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 73>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 73>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 73>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::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<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::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<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::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<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 74; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::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<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 74; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::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<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 74; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::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<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 74; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::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<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 74; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::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<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::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<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::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<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 74; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::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<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 74; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::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<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 74; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::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<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 74; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::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<array<int, 74>, pair<double, double> >*, vector<pair<array<int, 74>, pair<double, double> >, allocator<pair<array<int, 74>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<74, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 74; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 74>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 74>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 74>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::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<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::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<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::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<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 75; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::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<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 75; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::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<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 75; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::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<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 75; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::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<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 75; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::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<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::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<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::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<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 75; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::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<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 75; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::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<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 75; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::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<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 75; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::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<array<int, 75>, pair<double, double> >*, vector<pair<array<int, 75>, pair<double, double> >, allocator<pair<array<int, 75>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<75, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 75; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 75>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 75>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 75>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::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<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::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<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::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<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 76; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::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<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 76; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::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<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 76; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::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<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 76; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::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<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 76; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::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<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::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<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::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<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 76; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::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<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 76; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::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<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 76; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::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<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 76; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::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<array<int, 76>, pair<double, double> >*, vector<pair<array<int, 76>, pair<double, double> >, allocator<pair<array<int, 76>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<76, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 76; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 76>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 76>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 76>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::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<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::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<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::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<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 77; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::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<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 77; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::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<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 77; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::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<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 77; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::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<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 77; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::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<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::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<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::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<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 77; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::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<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 77; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::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<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 77; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::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<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 77; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::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<array<int, 77>, pair<double, double> >*, vector<pair<array<int, 77>, pair<double, double> >, allocator<pair<array<int, 77>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<77, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 77; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 77>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 77>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 77>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::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<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::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<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::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<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 78; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::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<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 78; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::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<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 78; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::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<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 78; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::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<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 78; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::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<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::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<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::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<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 78; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::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<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 78; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::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<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 78; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::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<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 78; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::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<array<int, 78>, pair<double, double> >*, vector<pair<array<int, 78>, pair<double, double> >, allocator<pair<array<int, 78>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<78, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 78; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 78>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 78>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 78>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::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<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::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<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::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<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 79; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::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<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 79; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::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<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 79; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::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<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 79; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::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<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 79; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::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<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::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<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::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<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 79; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::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<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 79; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::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<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 79; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::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<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 79; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::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<array<int, 79>, pair<double, double> >*, vector<pair<array<int, 79>, pair<double, double> >, allocator<pair<array<int, 79>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<79, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 79; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 79>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 79>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 79>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::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<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::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<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::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<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::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<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::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<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 80; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::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<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 80; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::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<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 80; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::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<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 80; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::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<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 80; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::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<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 80; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::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<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 80; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::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<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 80; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::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<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 80; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::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<array<int, 80>, pair<double, double> >*, vector<pair<array<int, 80>, pair<double, double> >, allocator<pair<array<int, 80>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<80, 5, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 80; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 80>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 80>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 80>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 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 In file included from /usr/include/c++/14.1.1/bits/stl_algo.h:61, from /usr/include/c++/14.1.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++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 40>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 40>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 39>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 39>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 38>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 38>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 37>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 37>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 36>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 36>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 35>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 35>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 34>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 34>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 33>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 33>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 32>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 32>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 31>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 31>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1750 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Tp = pair<array<int, 40>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 In file included from /usr/include/c++/14.1.1/algorithm:60: /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Tp = pair<array<int, 40>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Tp = pair<array<int, 40>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Tp = pair<array<int, 40>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Tp = pair<array<int, 39>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Tp = pair<array<int, 39>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Tp = pair<array<int, 39>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Tp = pair<array<int, 39>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Tp = pair<array<int, 38>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Tp = pair<array<int, 38>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Tp = pair<array<int, 38>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Tp = pair<array<int, 38>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Tp = pair<array<int, 37>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Tp = pair<array<int, 37>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Tp = pair<array<int, 37>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Tp = pair<array<int, 37>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Tp = pair<array<int, 36>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Tp = pair<array<int, 36>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Tp = pair<array<int, 36>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Tp = pair<array<int, 36>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Tp = pair<array<int, 35>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Tp = pair<array<int, 35>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Tp = pair<array<int, 35>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Tp = pair<array<int, 35>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Tp = pair<array<int, 34>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Tp = pair<array<int, 34>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Tp = pair<array<int, 34>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Tp = pair<array<int, 34>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Tp = pair<array<int, 33>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Tp = pair<array<int, 33>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Tp = pair<array<int, 33>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Tp = pair<array<int, 33>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Tp = pair<array<int, 32>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Tp = pair<array<int, 32>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Tp = pair<array<int, 32>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Tp = pair<array<int, 32>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Tp = pair<array<int, 31>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Tp = pair<array<int, 31>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Tp = pair<array<int, 31>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Tp = pair<array<int, 31>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1770 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 40>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2359 | __merge_adaptive(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 39>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 38>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 37>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 36>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 35>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 34>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 33>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 32>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 31>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 40>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 39>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 38>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 37>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 36>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 35>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 34>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 33>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 32>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 31>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.1.1/bits/stl_algo.h:69: /usr/include/c++/14.1.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::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 31>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 32>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 33>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 34>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 35>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 36>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 37>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 38>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 39>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 40>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 31>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 31>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 31>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::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<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::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<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::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<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::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<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::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<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 31>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::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<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::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<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::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<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::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<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::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<array<int, 31>, pair<double, double> >*, vector<pair<array<int, 31>, pair<double, double> >, allocator<pair<array<int, 31>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<31, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 31>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 31>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 31>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 32>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 32>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 32>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::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<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::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<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::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<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::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<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::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<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 32>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::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<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::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<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::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<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::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<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::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<array<int, 32>, pair<double, double> >*, vector<pair<array<int, 32>, pair<double, double> >, allocator<pair<array<int, 32>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<32, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 32>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 32>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 32>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 33>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 33>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 33>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::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<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::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<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::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<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::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<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::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<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 33>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::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<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::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<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::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<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::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<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::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<array<int, 33>, pair<double, double> >*, vector<pair<array<int, 33>, pair<double, double> >, allocator<pair<array<int, 33>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<33, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 33>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 33>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 33>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 34>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 34>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 34>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::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<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::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<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::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<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::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<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::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<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 34>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::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<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::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<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::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<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::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<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::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<array<int, 34>, pair<double, double> >*, vector<pair<array<int, 34>, pair<double, double> >, allocator<pair<array<int, 34>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<34, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 34>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 34>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 34>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 35>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 35>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 35>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::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<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::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<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::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<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::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<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::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<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 35>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::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<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::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<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::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<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::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<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::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<array<int, 35>, pair<double, double> >*, vector<pair<array<int, 35>, pair<double, double> >, allocator<pair<array<int, 35>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<35, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 35>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 35>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 35>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 36>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 36>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 36>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::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<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::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<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::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<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::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<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::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<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 36>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::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<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::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<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::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<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::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<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::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<array<int, 36>, pair<double, double> >*, vector<pair<array<int, 36>, pair<double, double> >, allocator<pair<array<int, 36>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<36, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 36>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 36>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 36>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 37>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 37>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 37>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::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<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::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<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::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<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::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<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::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<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 37>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::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<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::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<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::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<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::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<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::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<array<int, 37>, pair<double, double> >*, vector<pair<array<int, 37>, pair<double, double> >, allocator<pair<array<int, 37>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<37, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 37>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 37>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 37>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 38>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 38>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 38>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::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<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::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<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::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<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::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<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::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<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 38>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::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<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::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<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::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<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::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<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::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<array<int, 38>, pair<double, double> >*, vector<pair<array<int, 38>, pair<double, double> >, allocator<pair<array<int, 38>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<38, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 38>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 38>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 38>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 39>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 39>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 39>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::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<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::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<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::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<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::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<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::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<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 39>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::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<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::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<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::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<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::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<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::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<array<int, 39>, pair<double, double> >*, vector<pair<array<int, 39>, pair<double, double> >, allocator<pair<array<int, 39>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<39, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 39>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 39>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 39>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 40>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 40>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 40>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 40>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::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<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 40; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::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<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 40; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::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<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 40; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::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<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 40; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::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<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 40; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::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<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::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<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::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<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::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<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::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<array<int, 40>, pair<double, double> >*, vector<pair<array<int, 40>, pair<double, double> >, allocator<pair<array<int, 40>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<40, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 40>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 40>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 40>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ CXX enum-parallel/libfplll_la-enumlib_dim.30.lo In file included from /usr/include/c++/14.1.1/bits/stl_algo.h:61, from /usr/include/c++/14.1.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++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 50>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 50>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 49>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 49>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 48>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 48>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 47>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 47>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 46>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 46>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 45>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 45>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 44>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 44>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 43>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 43>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 42>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 42>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 41>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 41>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1750 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Tp = pair<array<int, 50>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 In file included from /usr/include/c++/14.1.1/algorithm:60: /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Tp = pair<array<int, 50>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Tp = pair<array<int, 50>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Tp = pair<array<int, 50>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Tp = pair<array<int, 49>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Tp = pair<array<int, 49>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Tp = pair<array<int, 49>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Tp = pair<array<int, 49>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Tp = pair<array<int, 48>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Tp = pair<array<int, 48>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Tp = pair<array<int, 48>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Tp = pair<array<int, 48>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Tp = pair<array<int, 47>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Tp = pair<array<int, 47>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Tp = pair<array<int, 47>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Tp = pair<array<int, 47>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Tp = pair<array<int, 46>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Tp = pair<array<int, 46>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Tp = pair<array<int, 46>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Tp = pair<array<int, 46>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Tp = pair<array<int, 45>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Tp = pair<array<int, 45>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Tp = pair<array<int, 45>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Tp = pair<array<int, 45>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Tp = pair<array<int, 44>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Tp = pair<array<int, 44>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Tp = pair<array<int, 44>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Tp = pair<array<int, 44>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Tp = pair<array<int, 43>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Tp = pair<array<int, 43>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Tp = pair<array<int, 43>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Tp = pair<array<int, 43>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Tp = pair<array<int, 42>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Tp = pair<array<int, 42>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Tp = pair<array<int, 42>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Tp = pair<array<int, 42>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Tp = pair<array<int, 41>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Tp = pair<array<int, 41>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Tp = pair<array<int, 41>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Tp = pair<array<int, 41>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1770 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 50>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2359 | __merge_adaptive(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 49>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 48>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 47>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 46>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 45>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 44>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 43>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 42>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 41>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 50>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 49>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 48>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 47>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 46>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 45>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 44>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 43>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 42>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 41>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.1.1/bits/stl_algo.h:69: /usr/include/c++/14.1.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::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 41>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 42>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 43>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 44>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 45>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 46>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 47>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 48>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 49>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 50>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 41>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 41>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 41>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 41>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 42>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 42>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 42>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 42>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 43>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 43>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 43>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 43>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 44>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 44>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 44>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 44>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 45>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 45>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 45>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 45>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 46>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 46>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 46>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 46>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 47>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 47>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 47>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 47>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 48>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 48>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 48>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 48>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 49>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 49>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 49>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 49>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 50>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 50>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 50>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 50>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::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<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 41; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::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<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 41; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::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<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 41; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::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<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 41; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::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<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 41; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::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<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::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<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::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<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::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<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::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<array<int, 41>, pair<double, double> >*, vector<pair<array<int, 41>, pair<double, double> >, allocator<pair<array<int, 41>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<41, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 41>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 41>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 41>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::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<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 42; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::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<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 42; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::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<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 42; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::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<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 42; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::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<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 42; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::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<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::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<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::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<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::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<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::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<array<int, 42>, pair<double, double> >*, vector<pair<array<int, 42>, pair<double, double> >, allocator<pair<array<int, 42>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<42, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 42>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 42>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 42>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::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<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 43; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::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<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 43; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::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<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 43; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::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<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 43; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::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<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 43; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::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<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::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<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::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<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::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<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::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<array<int, 43>, pair<double, double> >*, vector<pair<array<int, 43>, pair<double, double> >, allocator<pair<array<int, 43>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<43, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 43>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 43>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 43>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::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<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 44; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::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<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 44; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::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<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 44; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::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<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 44; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::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<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 44; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::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<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::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<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::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<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::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<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::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<array<int, 44>, pair<double, double> >*, vector<pair<array<int, 44>, pair<double, double> >, allocator<pair<array<int, 44>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<44, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 44>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 44>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 44>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::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<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 45; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::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<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 45; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::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<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 45; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::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<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 45; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::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<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 45; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::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<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::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<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::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<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::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<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::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<array<int, 45>, pair<double, double> >*, vector<pair<array<int, 45>, pair<double, double> >, allocator<pair<array<int, 45>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<45, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 45>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 45>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 45>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::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<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 46; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::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<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 46; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::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<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 46; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::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<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 46; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::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<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 46; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::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<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::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<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::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<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::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<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::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<array<int, 46>, pair<double, double> >*, vector<pair<array<int, 46>, pair<double, double> >, allocator<pair<array<int, 46>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<46, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 46>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 46>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 46>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::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<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 47; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::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<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 47; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::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<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 47; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::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<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 47; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::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<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 47; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::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<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::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<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::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<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::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<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::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<array<int, 47>, pair<double, double> >*, vector<pair<array<int, 47>, pair<double, double> >, allocator<pair<array<int, 47>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<47, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 47>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 47>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 47>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::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<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 48; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::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<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 48; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::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<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 48; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::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<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 48; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::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<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 48; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::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<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::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<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::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<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::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<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::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<array<int, 48>, pair<double, double> >*, vector<pair<array<int, 48>, pair<double, double> >, allocator<pair<array<int, 48>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<48, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 48>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 48>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 48>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::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<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 49; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::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<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 49; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::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<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 49; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::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<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 49; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::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<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 49; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::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<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::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<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::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<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::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<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::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<array<int, 49>, pair<double, double> >*, vector<pair<array<int, 49>, pair<double, double> >, allocator<pair<array<int, 49>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<49, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 49>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 49>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 49>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::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<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 50; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::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<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 50; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::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<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 50; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::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<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 50; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::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<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 50; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::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<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::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<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::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<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::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<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::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<array<int, 50>, pair<double, double> >*, vector<pair<array<int, 50>, pair<double, double> >, allocator<pair<array<int, 50>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<50, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 50>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 50>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 50>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.1.1/bits/stl_algo.h:61, from /usr/include/c++/14.1.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++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 70>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 70>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 69>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 69>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 68>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 68>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 67>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 67>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 66>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 66>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 65>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 65>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 64>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 64>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 63>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 63>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 62>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 62>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 61>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 61>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1750 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Tp = pair<array<int, 70>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 In file included from /usr/include/c++/14.1.1/algorithm:60: /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Tp = pair<array<int, 70>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Tp = pair<array<int, 70>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Tp = pair<array<int, 70>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Tp = pair<array<int, 69>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Tp = pair<array<int, 69>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Tp = pair<array<int, 69>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Tp = pair<array<int, 69>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Tp = pair<array<int, 68>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Tp = pair<array<int, 68>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Tp = pair<array<int, 68>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Tp = pair<array<int, 68>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Tp = pair<array<int, 67>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Tp = pair<array<int, 67>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Tp = pair<array<int, 67>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Tp = pair<array<int, 67>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Tp = pair<array<int, 66>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Tp = pair<array<int, 66>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Tp = pair<array<int, 66>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Tp = pair<array<int, 66>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Tp = pair<array<int, 65>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Tp = pair<array<int, 65>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Tp = pair<array<int, 65>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Tp = pair<array<int, 65>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Tp = pair<array<int, 64>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Tp = pair<array<int, 64>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Tp = pair<array<int, 64>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Tp = pair<array<int, 64>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Tp = pair<array<int, 63>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Tp = pair<array<int, 63>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Tp = pair<array<int, 63>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Tp = pair<array<int, 63>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Tp = pair<array<int, 62>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Tp = pair<array<int, 62>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Tp = pair<array<int, 62>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Tp = pair<array<int, 62>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Tp = pair<array<int, 61>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Tp = pair<array<int, 61>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Tp = pair<array<int, 61>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Tp = pair<array<int, 61>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1770 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 70>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2359 | __merge_adaptive(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 69>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 68>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 67>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 66>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 65>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 64>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 63>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 62>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 61>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 70>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 69>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 68>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 67>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 66>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 65>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 64>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 63>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 62>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 61>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.1.1/bits/stl_algo.h:69: /usr/include/c++/14.1.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::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 61>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 62>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 63>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 64>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 65>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 66>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 67>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 68>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 69>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 70>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 61>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 61>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 61>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 61>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 62>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 62>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 62>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 62>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 63>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 63>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 63>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 63>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 64>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 64>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 64>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 64>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 65>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 65>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 65>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 65>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 66>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 66>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 66>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 66>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 67>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 67>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 67>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 67>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 68>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 68>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 68>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 68>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 69>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 69>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 69>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 69>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 70>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 70>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 70>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 70>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::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<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::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<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::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<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 61; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::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<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 61; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::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<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 61; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::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<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 61; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::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<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 61; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::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<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::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<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::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<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 61; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::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<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 61; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::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<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 61; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::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<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 61; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::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<array<int, 61>, pair<double, double> >*, vector<pair<array<int, 61>, pair<double, double> >, allocator<pair<array<int, 61>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<61, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 61; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 61>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 61>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 61>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::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<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::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<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::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<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 62; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::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<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 62; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::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<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 62; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::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<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 62; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::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<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 62; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::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<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::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<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::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<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 62; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::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<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 62; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::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<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 62; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::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<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 62; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::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<array<int, 62>, pair<double, double> >*, vector<pair<array<int, 62>, pair<double, double> >, allocator<pair<array<int, 62>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<62, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 62; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 62>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 62>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 62>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::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<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::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<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::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<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 63; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::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<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 63; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::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<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 63; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::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<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 63; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::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<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 63; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::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<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::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<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::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<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 63; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::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<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 63; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::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<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 63; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::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<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 63; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::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<array<int, 63>, pair<double, double> >*, vector<pair<array<int, 63>, pair<double, double> >, allocator<pair<array<int, 63>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<63, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 63; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 63>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 63>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 63>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::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<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::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<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::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<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 64; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::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<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 64; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::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<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 64; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::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<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 64; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::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<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 64; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::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<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::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<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::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<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 64; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::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<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 64; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::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<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 64; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::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<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 64; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::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<array<int, 64>, pair<double, double> >*, vector<pair<array<int, 64>, pair<double, double> >, allocator<pair<array<int, 64>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<64, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 64; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 64>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 64>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 64>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::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<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::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<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::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<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 65; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::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<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 65; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::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<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 65; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::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<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 65; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::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<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 65; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::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<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::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<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::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<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 65; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::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<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 65; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::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<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 65; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::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<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 65; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::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<array<int, 65>, pair<double, double> >*, vector<pair<array<int, 65>, pair<double, double> >, allocator<pair<array<int, 65>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<65, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 65; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 65>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 65>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 65>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::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<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::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<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::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<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 66; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::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<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 66; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::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<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 66; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::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<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 66; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::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<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 66; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::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<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::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<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::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<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 66; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::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<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 66; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::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<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 66; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::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<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 66; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::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<array<int, 66>, pair<double, double> >*, vector<pair<array<int, 66>, pair<double, double> >, allocator<pair<array<int, 66>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<66, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 66; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 66>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 66>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 66>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::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<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::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<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::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<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 67; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::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<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 67; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::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<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 67; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::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<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 67; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::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<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 67; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::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<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::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<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::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<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 67; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::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<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 67; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::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<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 67; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::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<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 67; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::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<array<int, 67>, pair<double, double> >*, vector<pair<array<int, 67>, pair<double, double> >, allocator<pair<array<int, 67>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<67, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 67; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 67>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 67>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 67>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::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<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::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<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::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<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 68; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::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<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 68; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::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<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 68; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::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<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 68; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::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<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 68; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::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<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::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<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::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<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 68; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::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<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 68; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::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<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 68; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::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<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 68; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::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<array<int, 68>, pair<double, double> >*, vector<pair<array<int, 68>, pair<double, double> >, allocator<pair<array<int, 68>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<68, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 68; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 68>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 68>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 68>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::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<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::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<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::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<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 69; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::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<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 69; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::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<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 69; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::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<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 69; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::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<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 69; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::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<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::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<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::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<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 69; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::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<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 69; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::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<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 69; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::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<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 69; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::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<array<int, 69>, pair<double, double> >*, vector<pair<array<int, 69>, pair<double, double> >, allocator<pair<array<int, 69>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<69, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 69; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 69>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 69>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 69>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::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<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::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<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::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<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 70; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::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<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 70; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::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<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 70; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::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<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 70; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::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<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 70; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 340 | __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:340:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 254 | __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, | ^~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h:254:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 In function 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::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<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1868:25, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_algo.h:1593:23: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1593 | std::__make_heap(__first, __middle, __comp); | ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::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<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1869:23, inlined from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1884:27: /usr/include/c++/14.1.1/bits/stl_heap.h:425:26: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 425 | std::__pop_heap(__first, __last, __last, __comp); | ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::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<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 70; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::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<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 70; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::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<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 70; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::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<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 70; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::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<array<int, 70>, pair<double, double> >*, vector<pair<array<int, 70>, pair<double, double> >, allocator<pair<array<int, 70>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<70, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 70; bool findsubsols = false]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 70>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 70>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 70>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.1.1/bits/stl_algo.h:61, from /usr/include/c++/14.1.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++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 60>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 60>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 59>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 59>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 58>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 58>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 57>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 57>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 56>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 56>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 55>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 55>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 54>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 54>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 53>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 53>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 52>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 52>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 51>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 51>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1750 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Tp = pair<array<int, 60>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 In file included from /usr/include/c++/14.1.1/algorithm:60: /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Tp = pair<array<int, 60>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Tp = pair<array<int, 60>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Tp = pair<array<int, 60>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Tp = pair<array<int, 59>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Tp = pair<array<int, 59>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Tp = pair<array<int, 59>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Tp = pair<array<int, 59>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Tp = pair<array<int, 58>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Tp = pair<array<int, 58>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Tp = pair<array<int, 58>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Tp = pair<array<int, 58>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Tp = pair<array<int, 57>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Tp = pair<array<int, 57>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Tp = pair<array<int, 57>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Tp = pair<array<int, 57>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Tp = pair<array<int, 56>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Tp = pair<array<int, 56>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Tp = pair<array<int, 56>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Tp = pair<array<int, 56>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Tp = pair<array<int, 55>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Tp = pair<array<int, 55>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Tp = pair<array<int, 55>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Tp = pair<array<int, 55>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Tp = pair<array<int, 54>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Tp = pair<array<int, 54>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Tp = pair<array<int, 54>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Tp = pair<array<int, 54>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Tp = pair<array<int, 53>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Tp = pair<array<int, 53>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Tp = pair<array<int, 53>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Tp = pair<array<int, 53>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Tp = pair<array<int, 52>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Tp = pair<array<int, 52>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Tp = pair<array<int, 52>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Tp = pair<array<int, 52>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Tp = pair<array<int, 51>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Tp = pair<array<int, 51>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Tp = pair<array<int, 51>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Tp = pair<array<int, 51>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1770 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 60>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2359 | __merge_adaptive(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 59>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 58>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 57>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 56>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 55>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 54>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 53>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 52>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 51>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 60>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 59>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 58>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 57>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 56>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 55>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 54>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 53>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 52>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 51>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.1.1/bits/stl_algo.h:69: /usr/include/c++/14.1.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::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 51>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 52>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 53>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 54>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 55>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 56>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 57>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 58>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 59>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 60>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 51>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 51>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 51>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 51>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 52>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 52>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 52>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 52>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 53>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 53>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 53>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 53>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 54>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 54>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 54>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 54>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 55>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 55>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 55>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 55>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 56>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 56>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 56>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 56>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 57>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 57>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 57>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 57>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 58>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 58>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 58>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 58>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 59>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 59>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 59>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 59>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 60>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 60>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 60>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 60>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::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<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 51; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::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<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 51; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::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<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 51; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::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<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 51; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::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<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 51; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::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<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::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<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::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<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::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<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::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<array<int, 51>, pair<double, double> >*, vector<pair<array<int, 51>, pair<double, double> >, allocator<pair<array<int, 51>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<51, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 51>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 51>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 51>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::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<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 52; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::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<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 52; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::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<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 52; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::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<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 52; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::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<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 52; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::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<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::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<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::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<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::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<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::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<array<int, 52>, pair<double, double> >*, vector<pair<array<int, 52>, pair<double, double> >, allocator<pair<array<int, 52>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<52, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 52>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 52>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 52>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::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<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 53; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::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<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 53; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::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<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 53; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::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<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 53; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::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<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 53; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::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<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::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<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::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<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::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<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::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<array<int, 53>, pair<double, double> >*, vector<pair<array<int, 53>, pair<double, double> >, allocator<pair<array<int, 53>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<53, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 53>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 53>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 53>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::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<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 54; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::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<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 54; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::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<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 54; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::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<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 54; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::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<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 54; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::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<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::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<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::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<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::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<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::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<array<int, 54>, pair<double, double> >*, vector<pair<array<int, 54>, pair<double, double> >, allocator<pair<array<int, 54>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<54, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 54>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 54>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 54>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::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<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 55; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::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<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 55; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::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<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 55; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::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<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 55; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::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<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 55; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::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<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::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<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::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<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::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<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::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<array<int, 55>, pair<double, double> >*, vector<pair<array<int, 55>, pair<double, double> >, allocator<pair<array<int, 55>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<55, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 55>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 55>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 55>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::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<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 56; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::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<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 56; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::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<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 56; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::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<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 56; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::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<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 56; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::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<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::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<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::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<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::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<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::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<array<int, 56>, pair<double, double> >*, vector<pair<array<int, 56>, pair<double, double> >, allocator<pair<array<int, 56>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<56, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 56>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 56>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 56>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::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<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 57; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::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<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 57; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::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<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 57; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::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<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 57; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::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<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 57; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::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<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::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<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::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<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::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<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::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<array<int, 57>, pair<double, double> >*, vector<pair<array<int, 57>, pair<double, double> >, allocator<pair<array<int, 57>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<57, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 57>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 57>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 57>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::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<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 58; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::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<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 58; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::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<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 58; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::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<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 58; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::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<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 58; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::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<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::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<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::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<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::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<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::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<array<int, 58>, pair<double, double> >*, vector<pair<array<int, 58>, pair<double, double> >, allocator<pair<array<int, 58>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<58, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 58>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 58>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 58>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::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<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 59; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::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<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 59; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::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<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 59; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::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<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 59; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::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<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 59; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::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<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::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<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::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<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::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<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::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<array<int, 59>, pair<double, double> >*, vector<pair<array<int, 59>, pair<double, double> >, allocator<pair<array<int, 59>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<59, 3, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 59>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 59>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 59>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::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<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 60; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::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<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 60; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::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<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 60; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::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<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 60; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::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<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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<long long unsigned int, 1024> fplll::enumlib::enumerate_dim_detail(int, float_type, std::function<void(double*, unsigned int, bool, double*, double*)>, std::function<double(double, double*)>, std::function<void(double, double*, int)>, bool) [with int dimension = 60; bool findsubsols = true]' at enum-parallel/enumlib_dim.cpp:71:26: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::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<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::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<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::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<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::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<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::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<array<int, 60>, pair<double, double> >*, vector<pair<array<int, 60>, pair<double, double> >, allocator<pair<array<int, 60>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<60, 4, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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: /usr/include/c++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 60>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 60>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 60>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.1.1/bits/stl_algo.h:61, from /usr/include/c++/14.1.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++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 30>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 30>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 29>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 29>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 28>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 28>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 27>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 27>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 26>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 26>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 25>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 25>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 24>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 24>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 23>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 23>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 22>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 22>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 21>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 21>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1750 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Tp = pair<array<int, 30>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 In file included from /usr/include/c++/14.1.1/algorithm:60: /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Tp = pair<array<int, 30>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Tp = pair<array<int, 30>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Tp = pair<array<int, 30>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Tp = pair<array<int, 29>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Tp = pair<array<int, 29>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Tp = pair<array<int, 29>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Tp = pair<array<int, 29>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Tp = pair<array<int, 28>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Tp = pair<array<int, 28>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Tp = pair<array<int, 28>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Tp = pair<array<int, 28>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Tp = pair<array<int, 27>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Tp = pair<array<int, 27>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Tp = pair<array<int, 27>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Tp = pair<array<int, 27>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Tp = pair<array<int, 26>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Tp = pair<array<int, 26>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Tp = pair<array<int, 26>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Tp = pair<array<int, 26>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Tp = pair<array<int, 25>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Tp = pair<array<int, 25>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Tp = pair<array<int, 25>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Tp = pair<array<int, 25>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Tp = pair<array<int, 24>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Tp = pair<array<int, 24>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Tp = pair<array<int, 24>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Tp = pair<array<int, 24>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Tp = pair<array<int, 23>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Tp = pair<array<int, 23>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Tp = pair<array<int, 23>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Tp = pair<array<int, 23>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Tp = pair<array<int, 22>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Tp = pair<array<int, 22>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Tp = pair<array<int, 22>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Tp = pair<array<int, 22>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Tp = pair<array<int, 21>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Tp = pair<array<int, 21>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Tp = pair<array<int, 21>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Tp = pair<array<int, 21>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1770 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 30>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2359 | __merge_adaptive(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 29>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 28>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 27>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 26>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 25>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 24>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 23>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 22>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 21>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 30>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 29>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 28>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 27>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 26>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 25>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 24>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 23>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 22>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 21>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.1.1/bits/stl_algo.h:69: /usr/include/c++/14.1.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::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 21>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 22>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 23>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 24>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 25>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 26>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 27>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 28>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 29>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 30>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 21>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 21>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 21>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::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<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::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<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::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<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::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<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::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<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 21>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::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<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::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<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::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<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::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<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::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<array<int, 21>, pair<double, double> >*, vector<pair<array<int, 21>, pair<double, double> >, allocator<pair<array<int, 21>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<21, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 21>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 21>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 21>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 22>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 22>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 22>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::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<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::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<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::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<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::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<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::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<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 22>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::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<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::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<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::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<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::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<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::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<array<int, 22>, pair<double, double> >*, vector<pair<array<int, 22>, pair<double, double> >, allocator<pair<array<int, 22>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<22, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 22>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 22>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 22>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 23>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 23>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 23>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::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<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::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<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::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<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::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<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::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<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 23>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::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<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::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<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::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<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::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<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::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<array<int, 23>, pair<double, double> >*, vector<pair<array<int, 23>, pair<double, double> >, allocator<pair<array<int, 23>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<23, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 23>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 23>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 23>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 24>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 24>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 24>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::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<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::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<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::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<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::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<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::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<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 24>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::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<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::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<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::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<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::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<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::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<array<int, 24>, pair<double, double> >*, vector<pair<array<int, 24>, pair<double, double> >, allocator<pair<array<int, 24>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<24, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 24>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 24>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 24>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 25>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 25>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 25>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::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<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::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<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::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<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::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<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::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<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 25>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::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<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::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<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::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<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::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<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::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<array<int, 25>, pair<double, double> >*, vector<pair<array<int, 25>, pair<double, double> >, allocator<pair<array<int, 25>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<25, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 25>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 25>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 25>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 26>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 26>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 26>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::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<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::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<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::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<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::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<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::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<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 26>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::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<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::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<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::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<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::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<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::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<array<int, 26>, pair<double, double> >*, vector<pair<array<int, 26>, pair<double, double> >, allocator<pair<array<int, 26>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<26, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 26>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 26>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 26>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 27>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 27>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 27>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::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<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::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<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::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<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::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<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::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<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 27>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::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<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::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<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::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<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::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<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::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<array<int, 27>, pair<double, double> >*, vector<pair<array<int, 27>, pair<double, double> >, allocator<pair<array<int, 27>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<27, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 27>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 27>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 27>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 28>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 28>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 28>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::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<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::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<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::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<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::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<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::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<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 28>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::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<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::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<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::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<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::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<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::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<array<int, 28>, pair<double, double> >*, vector<pair<array<int, 28>, pair<double, double> >, allocator<pair<array<int, 28>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<28, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 28>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 28>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 28>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 29>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 29>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 29>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::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<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::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<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::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<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::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<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::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<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 29>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::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<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::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<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::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<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::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<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::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<array<int, 29>, pair<double, double> >*, vector<pair<array<int, 29>, pair<double, double> >, allocator<pair<array<int, 29>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<29, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 29>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 29>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 29>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 30>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 30>, pair<double, double> >*; _Distance = int]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2352:20: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 30>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::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<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::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<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::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<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::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<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::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<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, false>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 30>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2382 | __merge_adaptive_resize(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2382:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2390:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2390 | std::__merge_adaptive(__first, __middle, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 2391 | __len1, __len2, __buffer, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2403:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2403 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2404 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2412:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2412 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2413 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2418:37: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2418 | = std::__rotate_adaptive(__first_cut, __middle, __second_cut, | ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2419 | _Distance(__len1 - __len11), __len22, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2420 | __buffer, __buffer_size); | ~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2421:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2421 | std::__merge_adaptive_resize(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2422 | __len11, __len22, | ~~~~~~~~~~~~~~~~~ 2423 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2424:39: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2424 | std::__merge_adaptive_resize(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2425 | _Distance(__len1 - __len11), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2426 | _Distance(__len2 - __len22), | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2427 | __buffer, __buffer_size, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::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<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::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<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::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<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1905:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1905 | std::__introsort_loop(__first, __last, | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~ 1906 | std::__lg(__last - __first) * 2, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 1907 | __comp); | ~~~~~~~ In function 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::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<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:1908:31, inlined from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:4804:18, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:1817:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1817 | std::__insertion_sort(__first, __first + int(_S_threshold), __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1822:30: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 1822 | std::__insertion_sort(__first, __last, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~ In function 'void std::__inplace_merge(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::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<array<int, 30>, pair<double, double> >*, vector<pair<array<int, 30>, pair<double, double> >, allocator<pair<array<int, 30>, pair<double, double> > > > >; _Compare = fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<30, 2, 1024, 4, true>::swirl_item_t&)>]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2598:27, inlined from 'void fplll::enumlib::lattice_enum_t<N, SWIRLY, SWIRLY2BUF, SWIRLY1FRACTION, findsubsols>::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++/14.1.1/bits/stl_algo.h:2504:15: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2504 | _TmpBuf __buf(__first, std::min(__len1, __len2)); | ^~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2508:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2507 | std::__merge_adaptive | ~~~~~~~~~~~~~~~~~~~~~ 2508 | (__first, __middle, __last, __len1, __len2, __buf.begin(), __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2511:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2510 | std::__merge_without_buffer | ~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2511 | (__first, __middle, __last, __len1, __len2, __comp); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2514:11: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 30>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 30>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 30>, std::pair<double, double> > > > >' changed in GCC 7.1 2513 | std::__merge_adaptive_resize | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2514 | (__first, __middle, __last, __len1, __len2, __buf.begin(), | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2515 | _DistanceType(__buf.size()), __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ CXX enum-parallel/libfplll_la-enumlib_dim.20.lo In file included from /usr/include/c++/14.1.1/bits/stl_algo.h:61, from /usr/include/c++/14.1.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++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 20>, pair<double, double> >*, vector<pair<array<int, 20>, pair<double, double> >, allocator<pair<array<int, 20>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 20>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 224 | __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 20>, pair<double, double> >*, vector<pair<array<int, 20>, pair<double, double> >, allocator<pair<array<int, 20>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 20>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 19>, pair<double, double> >*, vector<pair<array<int, 19>, pair<double, double> >, allocator<pair<array<int, 19>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 19>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 19>, pair<double, double> >*, vector<pair<array<int, 19>, pair<double, double> >, allocator<pair<array<int, 19>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 19>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 18>, pair<double, double> >*, vector<pair<array<int, 18>, pair<double, double> >, allocator<pair<array<int, 18>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 18>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 18>, pair<double, double> >*, vector<pair<array<int, 18>, pair<double, double> >, allocator<pair<array<int, 18>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 18>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 17>, pair<double, double> >*, vector<pair<array<int, 17>, pair<double, double> >, allocator<pair<array<int, 17>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 17>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 17>, pair<double, double> >*, vector<pair<array<int, 17>, pair<double, double> >, allocator<pair<array<int, 17>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 17>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 16>, pair<double, double> >*, vector<pair<array<int, 16>, pair<double, double> >, allocator<pair<array<int, 16>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 16>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 16>, pair<double, double> >*, vector<pair<array<int, 16>, pair<double, double> >, allocator<pair<array<int, 16>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 16>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 15>, pair<double, double> >*, vector<pair<array<int, 15>, pair<double, double> >, allocator<pair<array<int, 15>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 15>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 15>, pair<double, double> >*, vector<pair<array<int, 15>, pair<double, double> >, allocator<pair<array<int, 15>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 15>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 14>, pair<double, double> >*, vector<pair<array<int, 14>, pair<double, double> >, allocator<pair<array<int, 14>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 14>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 14>, pair<double, double> >*, vector<pair<array<int, 14>, pair<double, double> >, allocator<pair<array<int, 14>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 14>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 13>, pair<double, double> >*, vector<pair<array<int, 13>, pair<double, double> >, allocator<pair<array<int, 13>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 13>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 13>, pair<double, double> >*, vector<pair<array<int, 13>, pair<double, double> >, allocator<pair<array<int, 13>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 13>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 12>, pair<double, double> >*, vector<pair<array<int, 12>, pair<double, double> >, allocator<pair<array<int, 12>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 12>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 12>, pair<double, double> >*, vector<pair<array<int, 12>, pair<double, double> >, allocator<pair<array<int, 12>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 12>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 11>, pair<double, double> >*, vector<pair<array<int, 11>, pair<double, double> >, allocator<pair<array<int, 11>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 11>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_heap.h: In function 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 11>, pair<double, double> >*, vector<pair<array<int, 11>, pair<double, double> >, allocator<pair<array<int, 11>, pair<double, double> > > > >; _Distance = int; _Tp = pair<array<int, 11>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_heap.h:224:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 20>, pair<double, double> >*, vector<pair<array<int, 20>, pair<double, double> >, allocator<pair<array<int, 20>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 1750 | __unguarded_linear_insert(_RandomAccessIterator __last, | ^~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 20>, pair<double, double> >*, vector<pair<array<int, 20>, pair<double, double> >, allocator<pair<array<int, 20>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 19>, pair<double, double> >*, vector<pair<array<int, 19>, pair<double, double> >, allocator<pair<array<int, 19>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 19>, pair<double, double> >*, vector<pair<array<int, 19>, pair<double, double> >, allocator<pair<array<int, 19>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 18>, pair<double, double> >*, vector<pair<array<int, 18>, pair<double, double> >, allocator<pair<array<int, 18>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 18>, pair<double, double> >*, vector<pair<array<int, 18>, pair<double, double> >, allocator<pair<array<int, 18>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 17>, pair<double, double> >*, vector<pair<array<int, 17>, pair<double, double> >, allocator<pair<array<int, 17>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 17>, pair<double, double> >*, vector<pair<array<int, 17>, pair<double, double> >, allocator<pair<array<int, 17>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 16>, pair<double, double> >*, vector<pair<array<int, 16>, pair<double, double> >, allocator<pair<array<int, 16>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 16>, pair<double, double> >*, vector<pair<array<int, 16>, pair<double, double> >, allocator<pair<array<int, 16>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 15>, pair<double, double> >*, vector<pair<array<int, 15>, pair<double, double> >, allocator<pair<array<int, 15>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 15>, pair<double, double> >*, vector<pair<array<int, 15>, pair<double, double> >, allocator<pair<array<int, 15>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 14>, pair<double, double> >*, vector<pair<array<int, 14>, pair<double, double> >, allocator<pair<array<int, 14>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 14>, pair<double, double> >*, vector<pair<array<int, 14>, pair<double, double> >, allocator<pair<array<int, 14>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 13>, pair<double, double> >*, vector<pair<array<int, 13>, pair<double, double> >, allocator<pair<array<int, 13>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 13>, pair<double, double> >*, vector<pair<array<int, 13>, pair<double, double> >, allocator<pair<array<int, 13>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 12>, pair<double, double> >*, vector<pair<array<int, 12>, pair<double, double> >, allocator<pair<array<int, 12>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 12>, pair<double, double> >*, vector<pair<array<int, 12>, pair<double, double> >, allocator<pair<array<int, 12>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 11>, pair<double, double> >*, vector<pair<array<int, 11>, pair<double, double> >, allocator<pair<array<int, 11>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 11>, pair<double, double> >*, vector<pair<array<int, 11>, pair<double, double> >, allocator<pair<array<int, 11>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1750:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 20>, pair<double, double> >*, vector<pair<array<int, 20>, pair<double, double> >, allocator<pair<array<int, 20>, pair<double, double> > > > >; _Tp = pair<array<int, 20>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 In file included from /usr/include/c++/14.1.1/algorithm:60: /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 20>, pair<double, double> >*, vector<pair<array<int, 20>, pair<double, double> >, allocator<pair<array<int, 20>, pair<double, double> > > > >; _Tp = pair<array<int, 20>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 20>, pair<double, double> >*, vector<pair<array<int, 20>, pair<double, double> >, allocator<pair<array<int, 20>, pair<double, double> > > > >; _Tp = pair<array<int, 20>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 20>, pair<double, double> >*, vector<pair<array<int, 20>, pair<double, double> >, allocator<pair<array<int, 20>, pair<double, double> > > > >; _Tp = pair<array<int, 20>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 19>, pair<double, double> >*, vector<pair<array<int, 19>, pair<double, double> >, allocator<pair<array<int, 19>, pair<double, double> > > > >; _Tp = pair<array<int, 19>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 19>, pair<double, double> >*, vector<pair<array<int, 19>, pair<double, double> >, allocator<pair<array<int, 19>, pair<double, double> > > > >; _Tp = pair<array<int, 19>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 19>, pair<double, double> >*, vector<pair<array<int, 19>, pair<double, double> >, allocator<pair<array<int, 19>, pair<double, double> > > > >; _Tp = pair<array<int, 19>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 19>, pair<double, double> >*, vector<pair<array<int, 19>, pair<double, double> >, allocator<pair<array<int, 19>, pair<double, double> > > > >; _Tp = pair<array<int, 19>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 18>, pair<double, double> >*, vector<pair<array<int, 18>, pair<double, double> >, allocator<pair<array<int, 18>, pair<double, double> > > > >; _Tp = pair<array<int, 18>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 18>, pair<double, double> >*, vector<pair<array<int, 18>, pair<double, double> >, allocator<pair<array<int, 18>, pair<double, double> > > > >; _Tp = pair<array<int, 18>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 18>, pair<double, double> >*, vector<pair<array<int, 18>, pair<double, double> >, allocator<pair<array<int, 18>, pair<double, double> > > > >; _Tp = pair<array<int, 18>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 18>, pair<double, double> >*, vector<pair<array<int, 18>, pair<double, double> >, allocator<pair<array<int, 18>, pair<double, double> > > > >; _Tp = pair<array<int, 18>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 17>, pair<double, double> >*, vector<pair<array<int, 17>, pair<double, double> >, allocator<pair<array<int, 17>, pair<double, double> > > > >; _Tp = pair<array<int, 17>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 17>, pair<double, double> >*, vector<pair<array<int, 17>, pair<double, double> >, allocator<pair<array<int, 17>, pair<double, double> > > > >; _Tp = pair<array<int, 17>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 17>, pair<double, double> >*, vector<pair<array<int, 17>, pair<double, double> >, allocator<pair<array<int, 17>, pair<double, double> > > > >; _Tp = pair<array<int, 17>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 17>, pair<double, double> >*, vector<pair<array<int, 17>, pair<double, double> >, allocator<pair<array<int, 17>, pair<double, double> > > > >; _Tp = pair<array<int, 17>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 16>, pair<double, double> >*, vector<pair<array<int, 16>, pair<double, double> >, allocator<pair<array<int, 16>, pair<double, double> > > > >; _Tp = pair<array<int, 16>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 16>, pair<double, double> >*, vector<pair<array<int, 16>, pair<double, double> >, allocator<pair<array<int, 16>, pair<double, double> > > > >; _Tp = pair<array<int, 16>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 16>, pair<double, double> >*, vector<pair<array<int, 16>, pair<double, double> >, allocator<pair<array<int, 16>, pair<double, double> > > > >; _Tp = pair<array<int, 16>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 16>, pair<double, double> >*, vector<pair<array<int, 16>, pair<double, double> >, allocator<pair<array<int, 16>, pair<double, double> > > > >; _Tp = pair<array<int, 16>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 15>, pair<double, double> >*, vector<pair<array<int, 15>, pair<double, double> >, allocator<pair<array<int, 15>, pair<double, double> > > > >; _Tp = pair<array<int, 15>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 15>, pair<double, double> >*, vector<pair<array<int, 15>, pair<double, double> >, allocator<pair<array<int, 15>, pair<double, double> > > > >; _Tp = pair<array<int, 15>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 15>, pair<double, double> >*, vector<pair<array<int, 15>, pair<double, double> >, allocator<pair<array<int, 15>, pair<double, double> > > > >; _Tp = pair<array<int, 15>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 15>, pair<double, double> >*, vector<pair<array<int, 15>, pair<double, double> >, allocator<pair<array<int, 15>, pair<double, double> > > > >; _Tp = pair<array<int, 15>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 14>, pair<double, double> >*, vector<pair<array<int, 14>, pair<double, double> >, allocator<pair<array<int, 14>, pair<double, double> > > > >; _Tp = pair<array<int, 14>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 14>, pair<double, double> >*, vector<pair<array<int, 14>, pair<double, double> >, allocator<pair<array<int, 14>, pair<double, double> > > > >; _Tp = pair<array<int, 14>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 14>, pair<double, double> >*, vector<pair<array<int, 14>, pair<double, double> >, allocator<pair<array<int, 14>, pair<double, double> > > > >; _Tp = pair<array<int, 14>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 14>, pair<double, double> >*, vector<pair<array<int, 14>, pair<double, double> >, allocator<pair<array<int, 14>, pair<double, double> > > > >; _Tp = pair<array<int, 14>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 13>, pair<double, double> >*, vector<pair<array<int, 13>, pair<double, double> >, allocator<pair<array<int, 13>, pair<double, double> > > > >; _Tp = pair<array<int, 13>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 13>, pair<double, double> >*, vector<pair<array<int, 13>, pair<double, double> >, allocator<pair<array<int, 13>, pair<double, double> > > > >; _Tp = pair<array<int, 13>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 13>, pair<double, double> >*, vector<pair<array<int, 13>, pair<double, double> >, allocator<pair<array<int, 13>, pair<double, double> > > > >; _Tp = pair<array<int, 13>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 13>, pair<double, double> >*, vector<pair<array<int, 13>, pair<double, double> >, allocator<pair<array<int, 13>, pair<double, double> > > > >; _Tp = pair<array<int, 13>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 12>, pair<double, double> >*, vector<pair<array<int, 12>, pair<double, double> >, allocator<pair<array<int, 12>, pair<double, double> > > > >; _Tp = pair<array<int, 12>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 12>, pair<double, double> >*, vector<pair<array<int, 12>, pair<double, double> >, allocator<pair<array<int, 12>, pair<double, double> > > > >; _Tp = pair<array<int, 12>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 12>, pair<double, double> >*, vector<pair<array<int, 12>, pair<double, double> >, allocator<pair<array<int, 12>, pair<double, double> > > > >; _Tp = pair<array<int, 12>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 12>, pair<double, double> >*, vector<pair<array<int, 12>, pair<double, double> >, allocator<pair<array<int, 12>, pair<double, double> > > > >; _Tp = pair<array<int, 12>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 11>, pair<double, double> >*, vector<pair<array<int, 11>, pair<double, double> >, allocator<pair<array<int, 11>, pair<double, double> > > > >; _Tp = pair<array<int, 11>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 11>, pair<double, double> >*, vector<pair<array<int, 11>, pair<double, double> >, allocator<pair<array<int, 11>, pair<double, double> > > > >; _Tp = pair<array<int, 11>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function '_ForwardIterator std::__upper_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 11>, pair<double, double> >*, vector<pair<array<int, 11>, pair<double, double> >, allocator<pair<array<int, 11>, pair<double, double> > > > >; _Tp = pair<array<int, 11>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 1980 | __upper_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1980:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algobase.h: In function '_ForwardIterator std::__lower_bound(_ForwardIterator, _ForwardIterator, const _Tp&, _Compare) [with _ForwardIterator = __gnu_cxx::__normal_iterator<pair<array<int, 11>, pair<double, double> >*, vector<pair<array<int, 11>, pair<double, double> >, allocator<pair<array<int, 11>, pair<double, double> > > > >; _Tp = pair<array<int, 11>, pair<double, double> >; _Compare = __gnu_cxx::__ops::_Iter_comp_val<fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 1488 | __lower_bound(_ForwardIterator __first, _ForwardIterator __last, | ^~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algobase.h:1488:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 20>, pair<double, double> >*, vector<pair<array<int, 20>, pair<double, double> >, allocator<pair<array<int, 20>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 1770 | __insertion_sort(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 20>, pair<double, double> >*, vector<pair<array<int, 20>, pair<double, double> >, allocator<pair<array<int, 20>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 19>, pair<double, double> >*, vector<pair<array<int, 19>, pair<double, double> >, allocator<pair<array<int, 19>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 19>, pair<double, double> >*, vector<pair<array<int, 19>, pair<double, double> >, allocator<pair<array<int, 19>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 18>, pair<double, double> >*, vector<pair<array<int, 18>, pair<double, double> >, allocator<pair<array<int, 18>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 18>, pair<double, double> >*, vector<pair<array<int, 18>, pair<double, double> >, allocator<pair<array<int, 18>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 17>, pair<double, double> >*, vector<pair<array<int, 17>, pair<double, double> >, allocator<pair<array<int, 17>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 17>, pair<double, double> >*, vector<pair<array<int, 17>, pair<double, double> >, allocator<pair<array<int, 17>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 16>, pair<double, double> >*, vector<pair<array<int, 16>, pair<double, double> >, allocator<pair<array<int, 16>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 16>, pair<double, double> >*, vector<pair<array<int, 16>, pair<double, double> >, allocator<pair<array<int, 16>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 15>, pair<double, double> >*, vector<pair<array<int, 15>, pair<double, double> >, allocator<pair<array<int, 15>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 15>, pair<double, double> >*, vector<pair<array<int, 15>, pair<double, double> >, allocator<pair<array<int, 15>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 14>, pair<double, double> >*, vector<pair<array<int, 14>, pair<double, double> >, allocator<pair<array<int, 14>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 14>, pair<double, double> >*, vector<pair<array<int, 14>, pair<double, double> >, allocator<pair<array<int, 14>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 13>, pair<double, double> >*, vector<pair<array<int, 13>, pair<double, double> >, allocator<pair<array<int, 13>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 13>, pair<double, double> >*, vector<pair<array<int, 13>, pair<double, double> >, allocator<pair<array<int, 13>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 12>, pair<double, double> >*, vector<pair<array<int, 12>, pair<double, double> >, allocator<pair<array<int, 12>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 12>, pair<double, double> >*, vector<pair<array<int, 12>, pair<double, double> >, allocator<pair<array<int, 12>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 11>, pair<double, double> >*, vector<pair<array<int, 11>, pair<double, double> >, allocator<pair<array<int, 11>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 11>, pair<double, double> >*, vector<pair<array<int, 11>, pair<double, double> >, allocator<pair<array<int, 11>, pair<double, double> > > > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1770:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 20>, pair<double, double> >*, vector<pair<array<int, 20>, pair<double, double> >, allocator<pair<array<int, 20>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 20>, pair<double, double> >*, vector<pair<array<int, 20>, pair<double, double> >, allocator<pair<array<int, 20>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 20>, pair<double, double> >*, vector<pair<array<int, 20>, pair<double, double> >, allocator<pair<array<int, 20>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 19>, pair<double, double> >*, vector<pair<array<int, 19>, pair<double, double> >, allocator<pair<array<int, 19>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 19>, pair<double, double> >*, vector<pair<array<int, 19>, pair<double, double> >, allocator<pair<array<int, 19>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 19>, pair<double, double> >*, vector<pair<array<int, 19>, pair<double, double> >, allocator<pair<array<int, 19>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 18>, pair<double, double> >*, vector<pair<array<int, 18>, pair<double, double> >, allocator<pair<array<int, 18>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 18>, pair<double, double> >*, vector<pair<array<int, 18>, pair<double, double> >, allocator<pair<array<int, 18>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 18>, pair<double, double> >*, vector<pair<array<int, 18>, pair<double, double> >, allocator<pair<array<int, 18>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 17>, pair<double, double> >*, vector<pair<array<int, 17>, pair<double, double> >, allocator<pair<array<int, 17>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 17>, pair<double, double> >*, vector<pair<array<int, 17>, pair<double, double> >, allocator<pair<array<int, 17>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 17>, pair<double, double> >*, vector<pair<array<int, 17>, pair<double, double> >, allocator<pair<array<int, 17>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 16>, pair<double, double> >*, vector<pair<array<int, 16>, pair<double, double> >, allocator<pair<array<int, 16>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 16>, pair<double, double> >*, vector<pair<array<int, 16>, pair<double, double> >, allocator<pair<array<int, 16>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 16>, pair<double, double> >*, vector<pair<array<int, 16>, pair<double, double> >, allocator<pair<array<int, 16>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 15>, pair<double, double> >*, vector<pair<array<int, 15>, pair<double, double> >, allocator<pair<array<int, 15>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 15>, pair<double, double> >*, vector<pair<array<int, 15>, pair<double, double> >, allocator<pair<array<int, 15>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 15>, pair<double, double> >*, vector<pair<array<int, 15>, pair<double, double> >, allocator<pair<array<int, 15>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 14>, pair<double, double> >*, vector<pair<array<int, 14>, pair<double, double> >, allocator<pair<array<int, 14>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 14>, pair<double, double> >*, vector<pair<array<int, 14>, pair<double, double> >, allocator<pair<array<int, 14>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 14>, pair<double, double> >*, vector<pair<array<int, 14>, pair<double, double> >, allocator<pair<array<int, 14>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 13>, pair<double, double> >*, vector<pair<array<int, 13>, pair<double, double> >, allocator<pair<array<int, 13>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 13>, pair<double, double> >*, vector<pair<array<int, 13>, pair<double, double> >, allocator<pair<array<int, 13>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 13>, pair<double, double> >*, vector<pair<array<int, 13>, pair<double, double> >, allocator<pair<array<int, 13>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 12>, pair<double, double> >*, vector<pair<array<int, 12>, pair<double, double> >, allocator<pair<array<int, 12>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 12>, pair<double, double> >*, vector<pair<array<int, 12>, pair<double, double> >, allocator<pair<array<int, 12>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 12>, pair<double, double> >*, vector<pair<array<int, 12>, pair<double, double> >, allocator<pair<array<int, 12>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 1235 | __rotate(_RandomAccessIterator __first, | ^~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1235:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 11>, pair<double, double> >*, vector<pair<array<int, 11>, pair<double, double> >, allocator<pair<array<int, 11>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 11>, pair<double, double> >*, vector<pair<array<int, 11>, pair<double, double> >, allocator<pair<array<int, 11>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 11>, pair<double, double> >*, vector<pair<array<int, 11>, pair<double, double> >, allocator<pair<array<int, 11>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 20>, pair<double, double> >*, vector<pair<array<int, 20>, pair<double, double> >, allocator<pair<array<int, 20>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 20>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 2359 | __merge_adaptive(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 19>, pair<double, double> >*, vector<pair<array<int, 19>, pair<double, double> >, allocator<pair<array<int, 19>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 19>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 18>, pair<double, double> >*, vector<pair<array<int, 18>, pair<double, double> >, allocator<pair<array<int, 18>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 18>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 17>, pair<double, double> >*, vector<pair<array<int, 17>, pair<double, double> >, allocator<pair<array<int, 17>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 17>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 16>, pair<double, double> >*, vector<pair<array<int, 16>, pair<double, double> >, allocator<pair<array<int, 16>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 16>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 15>, pair<double, double> >*, vector<pair<array<int, 15>, pair<double, double> >, allocator<pair<array<int, 15>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 15>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 14>, pair<double, double> >*, vector<pair<array<int, 14>, pair<double, double> >, allocator<pair<array<int, 14>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 14>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 13>, pair<double, double> >*, vector<pair<array<int, 13>, pair<double, double> >, allocator<pair<array<int, 13>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 13>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 12>, pair<double, double> >*, vector<pair<array<int, 12>, pair<double, double> >, allocator<pair<array<int, 12>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 12>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 11>, pair<double, double> >*, vector<pair<array<int, 11>, pair<double, double> >, allocator<pair<array<int, 11>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 11>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 20>, pair<double, double> >*, vector<pair<array<int, 20>, pair<double, double> >, allocator<pair<array<int, 20>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 20>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 19>, pair<double, double> >*, vector<pair<array<int, 19>, pair<double, double> >, allocator<pair<array<int, 19>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 19>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 18>, pair<double, double> >*, vector<pair<array<int, 18>, pair<double, double> >, allocator<pair<array<int, 18>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 18>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 17>, pair<double, double> >*, vector<pair<array<int, 17>, pair<double, double> >, allocator<pair<array<int, 17>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 17>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 16>, pair<double, double> >*, vector<pair<array<int, 16>, pair<double, double> >, allocator<pair<array<int, 16>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 16>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 15>, pair<double, double> >*, vector<pair<array<int, 15>, pair<double, double> >, allocator<pair<array<int, 15>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 15>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 14>, pair<double, double> >*, vector<pair<array<int, 14>, pair<double, double> >, allocator<pair<array<int, 14>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 14>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 13>, pair<double, double> >*, vector<pair<array<int, 13>, pair<double, double> >, allocator<pair<array<int, 13>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 13>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 12>, pair<double, double> >*, vector<pair<array<int, 12>, pair<double, double> >, allocator<pair<array<int, 12>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 12>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.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<array<int, 11>, pair<double, double> >*, vector<pair<array<int, 11>, pair<double, double> >, allocator<pair<array<int, 11>, pair<double, double> > > > >; _Distance = int; _Pointer = pair<array<int, 11>, pair<double, double> >*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2359:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 20>, pair<double, double> >*, vector<pair<array<int, 20>, pair<double, double> >, allocator<pair<array<int, 20>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 20>, pair<double, double> >*, vector<pair<array<int, 20>, pair<double, double> >, allocator<pair<array<int, 20>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 20>, pair<double, double> >*, vector<pair<array<int, 20>, pair<double, double> >, allocator<pair<array<int, 20>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 19>, pair<double, double> >*, vector<pair<array<int, 19>, pair<double, double> >, allocator<pair<array<int, 19>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 19>, pair<double, double> >*, vector<pair<array<int, 19>, pair<double, double> >, allocator<pair<array<int, 19>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 19>, pair<double, double> >*, vector<pair<array<int, 19>, pair<double, double> >, allocator<pair<array<int, 19>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 18>, pair<double, double> >*, vector<pair<array<int, 18>, pair<double, double> >, allocator<pair<array<int, 18>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 18>, pair<double, double> >*, vector<pair<array<int, 18>, pair<double, double> >, allocator<pair<array<int, 18>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 18>, pair<double, double> >*, vector<pair<array<int, 18>, pair<double, double> >, allocator<pair<array<int, 18>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 17>, pair<double, double> >*, vector<pair<array<int, 17>, pair<double, double> >, allocator<pair<array<int, 17>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 17>, pair<double, double> >*, vector<pair<array<int, 17>, pair<double, double> >, allocator<pair<array<int, 17>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 17>, pair<double, double> >*, vector<pair<array<int, 17>, pair<double, double> >, allocator<pair<array<int, 17>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 16>, pair<double, double> >*, vector<pair<array<int, 16>, pair<double, double> >, allocator<pair<array<int, 16>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 16>, pair<double, double> >*, vector<pair<array<int, 16>, pair<double, double> >, allocator<pair<array<int, 16>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 16>, pair<double, double> >*, vector<pair<array<int, 16>, pair<double, double> >, allocator<pair<array<int, 16>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 15>, pair<double, double> >*, vector<pair<array<int, 15>, pair<double, double> >, allocator<pair<array<int, 15>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 15>, pair<double, double> >*, vector<pair<array<int, 15>, pair<double, double> >, allocator<pair<array<int, 15>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 15>, pair<double, double> >*, vector<pair<array<int, 15>, pair<double, double> >, allocator<pair<array<int, 15>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 14>, pair<double, double> >*, vector<pair<array<int, 14>, pair<double, double> >, allocator<pair<array<int, 14>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 14>, pair<double, double> >*, vector<pair<array<int, 14>, pair<double, double> >, allocator<pair<array<int, 14>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 14>, pair<double, double> >*, vector<pair<array<int, 14>, pair<double, double> >, allocator<pair<array<int, 14>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 13>, pair<double, double> >*, vector<pair<array<int, 13>, pair<double, double> >, allocator<pair<array<int, 13>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 13>, pair<double, double> >*, vector<pair<array<int, 13>, pair<double, double> >, allocator<pair<array<int, 13>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 13>, pair<double, double> >*, vector<pair<array<int, 13>, pair<double, double> >, allocator<pair<array<int, 13>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 12>, pair<double, double> >*, vector<pair<array<int, 12>, pair<double, double> >, allocator<pair<array<int, 12>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 12>, pair<double, double> >*, vector<pair<array<int, 12>, pair<double, double> >, allocator<pair<array<int, 12>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 12>, pair<double, double> >*, vector<pair<array<int, 12>, pair<double, double> >, allocator<pair<array<int, 12>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 11>, pair<double, double> >*, vector<pair<array<int, 11>, pair<double, double> >, allocator<pair<array<int, 11>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 2435 | __merge_without_buffer(_BidirectionalIterator __first, | ^~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2435:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2460:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 2460 | = std::__lower_bound(__middle, __last, *__first_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2461 | __gnu_cxx::__ops::__iter_comp_val(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2469:33: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 2469 | = std::__upper_bound(__first, __middle, *__second_cut, | ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2470 | __gnu_cxx::__ops::__val_comp_iter(__comp)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >]', inlined from 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 11>, pair<double, double> >*, vector<pair<array<int, 11>, pair<double, double> >, allocator<pair<array<int, 11>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]' at /usr/include/c++/14.1.1/bits/stl_algo.h:2475:15: /usr/include/c++/14.1.1/bits/stl_algo.h:1357:27: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 1357 | return std::__rotate(__first, __middle, __last, | ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~ 1358 | std::__iterator_category(__first)); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = __gnu_cxx::__normal_iterator<pair<array<int, 11>, pair<double, double> >*, vector<pair<array<int, 11>, pair<double, double> >, allocator<pair<array<int, 11>, pair<double, double> > > > >; _Distance = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:2476:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 2476 | std::__merge_without_buffer(__first, __first_cut, __new_middle, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2477 | __len11, __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2478:34: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 2478 | std::__merge_without_buffer(__new_middle, __second_cut, __last, | ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 2479 | __len1 - __len11, __len2 - __len22, __comp); | ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 11>, pair<double, double> >*, vector<pair<array<int, 11>, pair<double, double> >, allocator<pair<array<int, 11>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ In file included from /usr/include/c++/14.1.1/bits/stl_algo.h:69: /usr/include/c++/14.1.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::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 11>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 11>, pair<double, double> >*, vector<pair<array<int, 11>, pair<double, double> >, allocator<pair<array<int, 11>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<11, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 12>, pair<double, double> >*, vector<pair<array<int, 12>, pair<double, double> >, allocator<pair<array<int, 12>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 12>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 12>, pair<double, double> >*, vector<pair<array<int, 12>, pair<double, double> >, allocator<pair<array<int, 12>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<12, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 12>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 12>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 12>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 13>, pair<double, double> >*, vector<pair<array<int, 13>, pair<double, double> >, allocator<pair<array<int, 13>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 13>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 13>, pair<double, double> >*, vector<pair<array<int, 13>, pair<double, double> >, allocator<pair<array<int, 13>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<13, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 13>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 13>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 13>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 14>, pair<double, double> >*, vector<pair<array<int, 14>, pair<double, double> >, allocator<pair<array<int, 14>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 14>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 14>, pair<double, double> >*, vector<pair<array<int, 14>, pair<double, double> >, allocator<pair<array<int, 14>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<14, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 14>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 14>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 14>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 15>, pair<double, double> >*, vector<pair<array<int, 15>, pair<double, double> >, allocator<pair<array<int, 15>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 15>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 15>, pair<double, double> >*, vector<pair<array<int, 15>, pair<double, double> >, allocator<pair<array<int, 15>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<15, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 15>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 15>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 15>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 16>, pair<double, double> >*, vector<pair<array<int, 16>, pair<double, double> >, allocator<pair<array<int, 16>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 16>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 16>, pair<double, double> >*, vector<pair<array<int, 16>, pair<double, double> >, allocator<pair<array<int, 16>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<16, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 16>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 16>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 16>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 17>, pair<double, double> >*, vector<pair<array<int, 17>, pair<double, double> >, allocator<pair<array<int, 17>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 17>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 17>, pair<double, double> >*, vector<pair<array<int, 17>, pair<double, double> >, allocator<pair<array<int, 17>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<17, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 17>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 17>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 17>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 18>, pair<double, double> >*, vector<pair<array<int, 18>, pair<double, double> >, allocator<pair<array<int, 18>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 18>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 18>, pair<double, double> >*, vector<pair<array<int, 18>, pair<double, double> >, allocator<pair<array<int, 18>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<18, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 18>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 18>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 18>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 19>, pair<double, double> >*, vector<pair<array<int, 19>, pair<double, double> >, allocator<pair<array<int, 19>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 19>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 19>, pair<double, double> >*, vector<pair<array<int, 19>, pair<double, double> >, allocator<pair<array<int, 19>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<19, 1, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 19>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 19>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 19>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 20>, pair<double, double> >*, vector<pair<array<int, 20>, pair<double, double> >, allocator<pair<array<int, 20>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, true>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >; _Tp = std::pair<std::array<int, 20>, std::pair<double, double> >]': /usr/include/c++/14.1.1/bits/stl_tempbuf.h:263:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 263 | _Temporary_buffer<_ForwardIterator, _Tp>:: | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h: In function 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<pair<array<int, 20>, pair<double, double> >*, vector<pair<array<int, 20>, pair<double, double> >, allocator<pair<array<int, 20>, pair<double, double> > > > >; _Size = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::enumerate_recursive<>()::<lambda(const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&, const fplll::enumlib::lattice_enum_t<20, 2, 1024, 4, false>::swirl_item_t&)> >]': /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 1876 | __introsort_loop(_RandomAccessIterator __first, | ^~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:1876:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:1890:32: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 20>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 20>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 20>, std::pair<double, double> > > > >' changed in GCC 7.1 1890 | std::__introsort_loop(__cut, __last, __depth_limit, __comp); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.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<array<int, 11>, pair<double, double> >*, vector<pair<array<int, 11>, pair<double, double> >, allocator<pair<array<int, 11>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 11>, pair<double, double> >*; _Distance = int]': /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 2321 | __rotate_adaptive(_BidirectionalIterator1 __first, | ^~~~~~~~~~~~~~~~~ /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 /usr/include/c++/14.1.1/bits/stl_algo.h:2321:5: note: parameter passing for argument of type '__gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >' changed in GCC 7.1 In function '_FIter std::_V2::rotate(_FIter, _FIter, _FIter) [with _FIter = __gnu_cxx::__normal_iterator<std::pair<std::array<int, 11>, std::pair<double, double> >*, std::vector<std::pair<std::array<int, 11>, std::pair<double, double> >, std::allocator<std::pair<std::array<int, 11>, std::pair<double, double> > > > >]', inlined from '_BidirectionalIterator1 std::__rotate_adaptive(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator1, _Distance, _Distance, _BidirectionalIterator2, _Distance) [with _BidirectionalIterator1 = __gnu_cxx::__normal_iterator<pair<array<int, 11>, pair<double, double> >*, vector<pair<array<int, 11>, pair<double, double> >, allocator<pair<array<int, 11>, pair<double, double> > > > >; _BidirectionalIterator2 = pair<array<int, 11>